./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:20:35,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:20:35,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:20:35,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:20:35,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:20:35,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:20:35,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:20:35,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:20:35,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:20:35,117 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:20:35,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:20:35,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:20:35,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:20:35,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:20:35,118 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:20:35,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:20:35,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:20:35,119 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:20:35,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:20:35,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:20:35,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:20:35,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:20:35,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:20:35,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:20:35,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:20:35,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:20:35,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:20:35,121 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2025-01-10 06:20:35,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:20:35,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:20:35,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:20:35,354 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:20:35,354 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:20:35,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2025-01-10 06:20:36,535 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7dc49532/ef062e2b207849799a0e025294a1aef3/FLAG56c5f24cc [2025-01-10 06:20:36,871 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:20:36,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2025-01-10 06:20:36,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7dc49532/ef062e2b207849799a0e025294a1aef3/FLAG56c5f24cc [2025-01-10 06:20:37,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7dc49532/ef062e2b207849799a0e025294a1aef3 [2025-01-10 06:20:37,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:20:37,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:20:37,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:20:37,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:20:37,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:20:37,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dac9f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37, skipping insertion in model container [2025-01-10 06:20:37,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:20:37,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:20:37,398 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:20:37,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:20:37,512 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:20:37,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37 WrapperNode [2025-01-10 06:20:37,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:20:37,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:20:37,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:20:37,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:20:37,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,595 INFO L138 Inliner]: procedures = 176, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 938 [2025-01-10 06:20:37,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:20:37,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:20:37,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:20:37,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:20:37,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,669 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2025-01-10 06:20:37,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:20:37,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:20:37,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:20:37,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:20:37,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (1/1) ... [2025-01-10 06:20:37,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:20:37,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:37,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:20:37,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:20:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:20:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:20:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:20:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:20:37,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:20:37,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:20:37,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:20:37,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:20:37,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:20:37,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:20:37,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:20:37,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:20:37,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:20:37,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:20:37,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:20:37,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:20:37,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:20:37,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:20:37,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:20:37,918 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:20:37,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:20:38,759 INFO L? ?]: Removed 229 outVars from TransFormulas that were not future-live. [2025-01-10 06:20:38,759 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:20:38,776 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:20:38,776 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2025-01-10 06:20:38,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:20:38 BoogieIcfgContainer [2025-01-10 06:20:38,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:20:38,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:20:38,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:20:38,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:20:38,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:20:37" (1/3) ... [2025-01-10 06:20:38,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f134288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:20:38, skipping insertion in model container [2025-01-10 06:20:38,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:37" (2/3) ... [2025-01-10 06:20:38,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f134288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:20:38, skipping insertion in model container [2025-01-10 06:20:38,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:20:38" (3/3) ... [2025-01-10 06:20:38,788 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-2.i [2025-01-10 06:20:38,798 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:20:38,799 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test1-2.i that has 3 procedures, 256 locations, 1 initial locations, 25 loop locations, and 6 error locations. [2025-01-10 06:20:38,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:20:38,845 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;@6c2495b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:20:38,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:20:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 252 states, 241 states have (on average 1.6099585062240664) internal successors, (388), 247 states have internal predecessors, (388), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 06:20:38,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:38,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:20:38,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:38,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash 44703485, now seen corresponding path program 1 times [2025-01-10 06:20:38,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:38,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799310878] [2025-01-10 06:20:38,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:38,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:20:38,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:20:38,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:38,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:20:38,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:38,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799310878] [2025-01-10 06:20:38,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799310878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:38,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:38,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107935731] [2025-01-10 06:20:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:38,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:20:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:39,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:20:39,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:20:39,004 INFO L87 Difference]: Start difference. First operand has 252 states, 241 states have (on average 1.6099585062240664) internal successors, (388), 247 states have internal predecessors, (388), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:39,069 INFO L93 Difference]: Finished difference Result 698 states and 1101 transitions. [2025-01-10 06:20:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:20:39,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-01-10 06:20:39,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:39,081 INFO L225 Difference]: With dead ends: 698 [2025-01-10 06:20:39,082 INFO L226 Difference]: Without dead ends: 409 [2025-01-10 06:20:39,084 INFO L434 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 [2025-01-10 06:20:39,086 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 277 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:39,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 694 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-10 06:20:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 213. [2025-01-10 06:20:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 203 states have (on average 1.4532019704433496) internal successors, (295), 208 states have internal predecessors, (295), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 301 transitions. [2025-01-10 06:20:39,172 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 301 transitions. Word has length 5 [2025-01-10 06:20:39,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:39,172 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 301 transitions. [2025-01-10 06:20:39,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 301 transitions. [2025-01-10 06:20:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 06:20:39,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:39,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:20:39,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:20:39,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:39,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:39,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1362875753, now seen corresponding path program 1 times [2025-01-10 06:20:39,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:39,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261925317] [2025-01-10 06:20:39,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:39,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:39,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:20:39,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:20:39,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:39,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:20:39,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:39,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261925317] [2025-01-10 06:20:39,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261925317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:39,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:39,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:39,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010071899] [2025-01-10 06:20:39,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:39,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:39,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:39,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:39,322 INFO L87 Difference]: Start difference. First operand 213 states and 301 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:39,349 INFO L93 Difference]: Finished difference Result 218 states and 307 transitions. [2025-01-10 06:20:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:39,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 06:20:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:39,350 INFO L225 Difference]: With dead ends: 218 [2025-01-10 06:20:39,350 INFO L226 Difference]: Without dead ends: 217 [2025-01-10 06:20:39,351 INFO L434 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 [2025-01-10 06:20:39,351 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 2 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:39,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 590 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-10 06:20:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2025-01-10 06:20:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 211 states have internal predecessors, (298), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 304 transitions. [2025-01-10 06:20:39,362 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 304 transitions. Word has length 6 [2025-01-10 06:20:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:39,362 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 304 transitions. [2025-01-10 06:20:39,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 304 transitions. [2025-01-10 06:20:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:20:39,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:39,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:39,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:20:39,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:39,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash -700524554, now seen corresponding path program 1 times [2025-01-10 06:20:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:39,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101727704] [2025-01-10 06:20:39,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:39,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:39,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:20:39,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:20:39,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:39,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:20:39,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:39,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101727704] [2025-01-10 06:20:39,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101727704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:39,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:39,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:39,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991841719] [2025-01-10 06:20:39,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:39,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:39,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:39,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:39,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:39,490 INFO L87 Difference]: Start difference. First operand 216 states and 304 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:39,530 INFO L93 Difference]: Finished difference Result 218 states and 306 transitions. [2025-01-10 06:20:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:39,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 06:20:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:39,532 INFO L225 Difference]: With dead ends: 218 [2025-01-10 06:20:39,533 INFO L226 Difference]: Without dead ends: 217 [2025-01-10 06:20:39,534 INFO L434 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 [2025-01-10 06:20:39,534 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 879 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 [2025-01-10 06:20:39,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 879 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-10 06:20:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-01-10 06:20:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 207 states have (on average 1.4444444444444444) internal successors, (299), 212 states have internal predecessors, (299), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 305 transitions. [2025-01-10 06:20:39,548 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 305 transitions. Word has length 7 [2025-01-10 06:20:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:39,548 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 305 transitions. [2025-01-10 06:20:39,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 305 transitions. [2025-01-10 06:20:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 06:20:39,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:39,553 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:39,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:20:39,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:39,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1230645322, now seen corresponding path program 1 times [2025-01-10 06:20:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938759556] [2025-01-10 06:20:39,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:39,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:39,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 06:20:39,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 06:20:39,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:39,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:20:39,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:39,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938759556] [2025-01-10 06:20:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938759556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:39,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:39,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:20:39,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594408151] [2025-01-10 06:20:39,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:39,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:39,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:39,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:39,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:39,852 INFO L87 Difference]: Start difference. First operand 217 states and 305 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:39,913 INFO L93 Difference]: Finished difference Result 430 states and 606 transitions. [2025-01-10 06:20:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:39,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-01-10 06:20:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:39,915 INFO L225 Difference]: With dead ends: 430 [2025-01-10 06:20:39,915 INFO L226 Difference]: Without dead ends: 220 [2025-01-10 06:20:39,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:20:39,916 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 105 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:39,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 726 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-10 06:20:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2025-01-10 06:20:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 212 states have internal predecessors, (292), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 298 transitions. [2025-01-10 06:20:39,923 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 298 transitions. Word has length 79 [2025-01-10 06:20:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:39,923 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 298 transitions. [2025-01-10 06:20:39,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 298 transitions. [2025-01-10 06:20:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 06:20:39,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:39,925 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:39,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:20:39,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:39,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash 251759786, now seen corresponding path program 1 times [2025-01-10 06:20:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:39,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510178570] [2025-01-10 06:20:39,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:39,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 06:20:39,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 06:20:39,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:39,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:20:40,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:40,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510178570] [2025-01-10 06:20:40,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510178570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:40,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:40,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:40,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759262881] [2025-01-10 06:20:40,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:40,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:20:40,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:40,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:20:40,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:20:40,116 INFO L87 Difference]: Start difference. First operand 217 states and 298 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:40,174 INFO L93 Difference]: Finished difference Result 553 states and 775 transitions. [2025-01-10 06:20:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:20:40,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-01-10 06:20:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:40,178 INFO L225 Difference]: With dead ends: 553 [2025-01-10 06:20:40,178 INFO L226 Difference]: Without dead ends: 343 [2025-01-10 06:20:40,178 INFO L434 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 [2025-01-10 06:20:40,179 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 134 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:40,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 576 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-10 06:20:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-01-10 06:20:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 333 states have (on average 1.4324324324324325) internal successors, (477), 338 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 483 transitions. [2025-01-10 06:20:40,189 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 483 transitions. Word has length 79 [2025-01-10 06:20:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:40,189 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 483 transitions. [2025-01-10 06:20:40,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 483 transitions. [2025-01-10 06:20:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 06:20:40,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:40,191 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:40,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:20:40,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:40,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:40,192 INFO L85 PathProgramCache]: Analyzing trace with hash 192544732, now seen corresponding path program 1 times [2025-01-10 06:20:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197552225] [2025-01-10 06:20:40,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:40,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 06:20:40,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 06:20:40,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:40,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:40,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197552225] [2025-01-10 06:20:40,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197552225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:40,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:40,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:40,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660316833] [2025-01-10 06:20:40,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:40,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:40,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:40,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:40,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:40,425 INFO L87 Difference]: Start difference. First operand 343 states and 483 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:40,479 INFO L93 Difference]: Finished difference Result 409 states and 569 transitions. [2025-01-10 06:20:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-01-10 06:20:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:40,482 INFO L225 Difference]: With dead ends: 409 [2025-01-10 06:20:40,484 INFO L226 Difference]: Without dead ends: 407 [2025-01-10 06:20:40,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:40,485 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 186 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:40,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 945 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-10 06:20:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-01-10 06:20:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 394 states have (on average 1.4086294416243654) internal successors, (555), 399 states have internal predecessors, (555), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:20:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 567 transitions. [2025-01-10 06:20:40,506 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 567 transitions. Word has length 94 [2025-01-10 06:20:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:40,506 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 567 transitions. [2025-01-10 06:20:40,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 567 transitions. [2025-01-10 06:20:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 06:20:40,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:40,511 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 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, 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] [2025-01-10 06:20:40,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:20:40,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:40,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1108072224, now seen corresponding path program 1 times [2025-01-10 06:20:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568458141] [2025-01-10 06:20:40,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:40,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 06:20:40,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 06:20:40,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:40,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:40,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:40,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568458141] [2025-01-10 06:20:40,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568458141] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:40,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179069290] [2025-01-10 06:20:40,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:40,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:40,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:40,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:40,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:20:40,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 06:20:41,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 06:20:41,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:41,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:41,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:20:41,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:41,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:41,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179069290] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:41,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:41,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:20:41,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336286288] [2025-01-10 06:20:41,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:41,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:20:41,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:41,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:20:41,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:20:41,323 INFO L87 Difference]: Start difference. First operand 407 states and 567 transitions. Second operand has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:41,419 INFO L93 Difference]: Finished difference Result 613 states and 856 transitions. [2025-01-10 06:20:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:20:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 98 [2025-01-10 06:20:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:41,423 INFO L225 Difference]: With dead ends: 613 [2025-01-10 06:20:41,424 INFO L226 Difference]: Without dead ends: 607 [2025-01-10 06:20:41,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:20:41,425 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 868 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:41,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 2414 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-01-10 06:20:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 605. [2025-01-10 06:20:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 589 states have (on average 1.4091680814940577) internal successors, (830), 594 states have internal predecessors, (830), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 06:20:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 848 transitions. [2025-01-10 06:20:41,442 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 848 transitions. Word has length 98 [2025-01-10 06:20:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:41,442 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 848 transitions. [2025-01-10 06:20:41,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 848 transitions. [2025-01-10 06:20:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 06:20:41,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:41,443 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:41,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:20:41,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:41,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:41,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:41,645 INFO L85 PathProgramCache]: Analyzing trace with hash -13432858, now seen corresponding path program 1 times [2025-01-10 06:20:41,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:41,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854092119] [2025-01-10 06:20:41,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:41,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:41,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 06:20:41,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 06:20:41,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:41,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:42,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:42,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854092119] [2025-01-10 06:20:42,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854092119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:42,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065105615] [2025-01-10 06:20:42,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:42,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:42,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:42,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:42,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:20:42,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 06:20:42,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 06:20:42,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:42,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:42,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:20:42,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:42,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:42,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065105615] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:42,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:42,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 06:20:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971446479] [2025-01-10 06:20:42,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:42,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:20:42,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:42,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:20:42,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:20:42,772 INFO L87 Difference]: Start difference. First operand 605 states and 848 transitions. Second operand has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:42,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:42,888 INFO L93 Difference]: Finished difference Result 813 states and 1141 transitions. [2025-01-10 06:20:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:20:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 99 [2025-01-10 06:20:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:42,893 INFO L225 Difference]: With dead ends: 813 [2025-01-10 06:20:42,893 INFO L226 Difference]: Without dead ends: 812 [2025-01-10 06:20:42,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:20:42,894 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 653 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:42,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 2023 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-01-10 06:20:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 805. [2025-01-10 06:20:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 786 states have (on average 1.4083969465648856) internal successors, (1107), 791 states have internal predecessors, (1107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:20:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1131 transitions. [2025-01-10 06:20:42,914 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1131 transitions. Word has length 99 [2025-01-10 06:20:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:42,915 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1131 transitions. [2025-01-10 06:20:42,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1131 transitions. [2025-01-10 06:20:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 06:20:42,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:42,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:42,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:20:43,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:43,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:43,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash -416418535, now seen corresponding path program 1 times [2025-01-10 06:20:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:43,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265704713] [2025-01-10 06:20:43,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:43,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 06:20:43,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 06:20:43,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:43,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265704713] [2025-01-10 06:20:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265704713] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240958129] [2025-01-10 06:20:43,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:43,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:43,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:43,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:43,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:20:44,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 06:20:44,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 06:20:44,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:44,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:44,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:20:44,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:44,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:44,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240958129] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:44,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:44,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 06:20:44,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711164053] [2025-01-10 06:20:44,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:44,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:20:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:44,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:20:44,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:20:44,356 INFO L87 Difference]: Start difference. First operand 805 states and 1131 transitions. Second operand has 13 states, 12 states have (on average 15.916666666666666) internal successors, (191), 13 states have internal predecessors, (191), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:44,477 INFO L93 Difference]: Finished difference Result 813 states and 1138 transitions. [2025-01-10 06:20:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:20:44,478 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.916666666666666) internal successors, (191), 13 states have internal predecessors, (191), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 100 [2025-01-10 06:20:44,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:44,481 INFO L225 Difference]: With dead ends: 813 [2025-01-10 06:20:44,481 INFO L226 Difference]: Without dead ends: 812 [2025-01-10 06:20:44,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:20:44,481 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 792 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:44,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2454 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-01-10 06:20:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 806. [2025-01-10 06:20:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 787 states have (on average 1.4053367217280812) internal successors, (1106), 792 states have internal predecessors, (1106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:20:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1130 transitions. [2025-01-10 06:20:44,499 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1130 transitions. Word has length 100 [2025-01-10 06:20:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:44,500 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1130 transitions. [2025-01-10 06:20:44,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.916666666666666) internal successors, (191), 13 states have internal predecessors, (191), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1130 transitions. [2025-01-10 06:20:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-10 06:20:44,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:44,501 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:44,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:20:44,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:44,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:44,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1488731853, now seen corresponding path program 1 times [2025-01-10 06:20:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:44,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172571498] [2025-01-10 06:20:44,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:44,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:44,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-10 06:20:44,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-10 06:20:44,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:44,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:44,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172571498] [2025-01-10 06:20:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172571498] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:44,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112432878] [2025-01-10 06:20:44,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:44,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:44,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:44,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:45,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:20:45,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-10 06:20:45,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-10 06:20:45,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:45,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:45,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:20:45,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:45,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:20:45,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112432878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:45,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:20:45,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:20:45,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264438480] [2025-01-10 06:20:45,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:45,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:20:45,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:45,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:20:45,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:20:45,475 INFO L87 Difference]: Start difference. First operand 806 states and 1130 transitions. Second operand has 6 states, 5 states have (on average 33.0) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:45,519 INFO L93 Difference]: Finished difference Result 806 states and 1130 transitions. [2025-01-10 06:20:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:20:45,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.0) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-01-10 06:20:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:45,522 INFO L225 Difference]: With dead ends: 806 [2025-01-10 06:20:45,522 INFO L226 Difference]: Without dead ends: 805 [2025-01-10 06:20:45,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:20:45,524 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 383 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:45,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1386 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-01-10 06:20:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2025-01-10 06:20:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 787 states have (on average 1.4015247776365947) internal successors, (1103), 791 states have internal predecessors, (1103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:20:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1127 transitions. [2025-01-10 06:20:45,542 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1127 transitions. Word has length 172 [2025-01-10 06:20:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:45,542 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1127 transitions. [2025-01-10 06:20:45,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.0) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1127 transitions. [2025-01-10 06:20:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-10 06:20:45,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:45,545 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:45,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:20:45,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:20:45,745 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:45,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:45,746 INFO L85 PathProgramCache]: Analyzing trace with hash -99055907, now seen corresponding path program 1 times [2025-01-10 06:20:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:45,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504142857] [2025-01-10 06:20:45,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:45,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:45,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-10 06:20:45,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-10 06:20:45,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:45,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-10 06:20:46,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:46,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504142857] [2025-01-10 06:20:46,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504142857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:46,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:46,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:46,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013696326] [2025-01-10 06:20:46,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:46,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:46,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:46,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:46,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:46,054 INFO L87 Difference]: Start difference. First operand 805 states and 1127 transitions. Second operand has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:46,073 INFO L93 Difference]: Finished difference Result 805 states and 1127 transitions. [2025-01-10 06:20:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:46,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251 [2025-01-10 06:20:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:46,077 INFO L225 Difference]: With dead ends: 805 [2025-01-10 06:20:46,077 INFO L226 Difference]: Without dead ends: 804 [2025-01-10 06:20:46,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:46,078 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 195 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:46,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 584 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-01-10 06:20:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2025-01-10 06:20:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 787 states have (on average 1.3989834815756035) internal successors, (1101), 790 states have internal predecessors, (1101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:20:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1125 transitions. [2025-01-10 06:20:46,098 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1125 transitions. Word has length 251 [2025-01-10 06:20:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:46,098 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1125 transitions. [2025-01-10 06:20:46,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1125 transitions. [2025-01-10 06:20:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-10 06:20:46,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:46,103 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:46,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:20:46,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:46,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash -331201534, now seen corresponding path program 1 times [2025-01-10 06:20:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:46,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613869443] [2025-01-10 06:20:46,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:46,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-10 06:20:46,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-10 06:20:46,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:46,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:46,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:46,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613869443] [2025-01-10 06:20:46,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613869443] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:46,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596759590] [2025-01-10 06:20:46,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:46,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:46,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:46,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:46,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:20:46,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-10 06:20:46,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-10 06:20:46,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:46,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:46,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:20:46,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:47,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:47,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596759590] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:47,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:47,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-10 06:20:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367314216] [2025-01-10 06:20:47,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:47,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 06:20:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:47,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 06:20:47,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:20:47,513 INFO L87 Difference]: Start difference. First operand 804 states and 1125 transitions. Second operand has 18 states, 18 states have (on average 31.77777777777778) internal successors, (572), 18 states have internal predecessors, (572), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:47,664 INFO L93 Difference]: Finished difference Result 1400 states and 1964 transitions. [2025-01-10 06:20:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:20:47,665 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 31.77777777777778) internal successors, (572), 18 states have internal predecessors, (572), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 254 [2025-01-10 06:20:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:47,670 INFO L225 Difference]: With dead ends: 1400 [2025-01-10 06:20:47,670 INFO L226 Difference]: Without dead ends: 1395 [2025-01-10 06:20:47,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:20:47,670 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 2978 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2997 SdHoareTripleChecker+Valid, 2961 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:47,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2997 Valid, 2961 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-01-10 06:20:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1391. [2025-01-10 06:20:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1365 states have (on average 1.4014652014652014) internal successors, (1913), 1368 states have internal predecessors, (1913), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-10 06:20:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1955 transitions. [2025-01-10 06:20:47,695 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1955 transitions. Word has length 254 [2025-01-10 06:20:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:47,696 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1955 transitions. [2025-01-10 06:20:47,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 31.77777777777778) internal successors, (572), 18 states have internal predecessors, (572), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1955 transitions. [2025-01-10 06:20:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-01-10 06:20:47,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:47,699 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:47,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:20:47,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 06:20:47,900 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:47,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1424720947, now seen corresponding path program 1 times [2025-01-10 06:20:47,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:47,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89810120] [2025-01-10 06:20:47,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:47,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:47,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-01-10 06:20:48,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-01-10 06:20:48,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:48,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:49,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89810120] [2025-01-10 06:20:49,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89810120] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31566896] [2025-01-10 06:20:49,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:49,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:49,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:49,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:49,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:20:50,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-01-10 06:20:50,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-01-10 06:20:50,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:50,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:50,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 06:20:50,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:50,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31566896] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:51,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-01-10 06:20:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876416228] [2025-01-10 06:20:51,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:51,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 06:20:51,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:51,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 06:20:51,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-01-10 06:20:51,167 INFO L87 Difference]: Start difference. First operand 1391 states and 1955 transitions. Second operand has 28 states, 27 states have (on average 24.62962962962963) internal successors, (665), 28 states have internal predecessors, (665), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:51,522 INFO L93 Difference]: Finished difference Result 1996 states and 2816 transitions. [2025-01-10 06:20:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 06:20:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.62962962962963) internal successors, (665), 28 states have internal predecessors, (665), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 333 [2025-01-10 06:20:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:51,529 INFO L225 Difference]: With dead ends: 1996 [2025-01-10 06:20:51,529 INFO L226 Difference]: Without dead ends: 1995 [2025-01-10 06:20:51,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 06:20:51,530 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 3839 mSDsluCounter, 4024 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3862 SdHoareTripleChecker+Valid, 4308 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:51,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3862 Valid, 4308 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:20:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-01-10 06:20:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1985. [2025-01-10 06:20:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1950 states have (on average 1.4015384615384616) internal successors, (2733), 1953 states have internal predecessors, (2733), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 06:20:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2793 transitions. [2025-01-10 06:20:51,564 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2793 transitions. Word has length 333 [2025-01-10 06:20:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:51,564 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2793 transitions. [2025-01-10 06:20:51,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.62962962962963) internal successors, (665), 28 states have internal predecessors, (665), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2793 transitions. [2025-01-10 06:20:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-10 06:20:51,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:51,567 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:51,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:20:51,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 06:20:51,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:51,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1216676460, now seen corresponding path program 1 times [2025-01-10 06:20:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377480610] [2025-01-10 06:20:51,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:51,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:51,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-10 06:20:51,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-10 06:20:51,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:51,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:53,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377480610] [2025-01-10 06:20:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377480610] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418460416] [2025-01-10 06:20:53,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:53,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:53,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:53,299 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:53,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:20:53,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-10 06:20:53,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-10 06:20:53,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:53,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:53,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:20:53,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:54,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418460416] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:54,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:54,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-01-10 06:20:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102453131] [2025-01-10 06:20:54,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:54,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 06:20:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:54,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 06:20:54,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-01-10 06:20:54,638 INFO L87 Difference]: Start difference. First operand 1985 states and 2793 transitions. Second operand has 28 states, 27 states have (on average 24.74074074074074) internal successors, (668), 28 states have internal predecessors, (668), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:55,004 INFO L93 Difference]: Finished difference Result 1996 states and 2810 transitions. [2025-01-10 06:20:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:20:55,005 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.74074074074074) internal successors, (668), 28 states have internal predecessors, (668), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 334 [2025-01-10 06:20:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:55,012 INFO L225 Difference]: With dead ends: 1996 [2025-01-10 06:20:55,013 INFO L226 Difference]: Without dead ends: 1995 [2025-01-10 06:20:55,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 06:20:55,014 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 2936 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2959 SdHoareTripleChecker+Valid, 3662 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:55,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2959 Valid, 3662 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:20:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-01-10 06:20:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1986. [2025-01-10 06:20:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1951 states have (on average 1.398769861609431) internal successors, (2729), 1954 states have internal predecessors, (2729), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 06:20:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2789 transitions. [2025-01-10 06:20:55,070 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2789 transitions. Word has length 334 [2025-01-10 06:20:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:55,071 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2789 transitions. [2025-01-10 06:20:55,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.74074074074074) internal successors, (668), 28 states have internal predecessors, (668), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2789 transitions. [2025-01-10 06:20:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-01-10 06:20:55,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:55,081 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:55,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:20:55,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:55,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1285282490, now seen corresponding path program 2 times [2025-01-10 06:20:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82667641] [2025-01-10 06:20:55,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:20:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:55,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 566 statements into 2 equivalence classes. [2025-01-10 06:20:55,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 566 of 566 statements. [2025-01-10 06:20:55,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:20:55,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:56,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:56,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82667641] [2025-01-10 06:20:56,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82667641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:56,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334146355] [2025-01-10 06:20:56,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:20:56,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:56,725 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:56,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:20:57,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 566 statements into 2 equivalence classes. [2025-01-10 06:20:57,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 566 of 566 statements. [2025-01-10 06:20:57,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:20:57,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:57,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:20:57,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:58,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:58,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334146355] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:58,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:58,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-10 06:20:58,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558823964] [2025-01-10 06:20:58,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:58,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:20:58,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:58,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:20:58,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:20:58,601 INFO L87 Difference]: Start difference. First operand 1986 states and 2789 transitions. Second operand has 23 states, 23 states have (on average 35.17391304347826) internal successors, (809), 23 states have internal predecessors, (809), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:58,785 INFO L93 Difference]: Finished difference Result 1991 states and 2794 transitions. [2025-01-10 06:20:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 06:20:58,785 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 35.17391304347826) internal successors, (809), 23 states have internal predecessors, (809), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 566 [2025-01-10 06:20:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:58,792 INFO L225 Difference]: With dead ends: 1991 [2025-01-10 06:20:58,792 INFO L226 Difference]: Without dead ends: 1986 [2025-01-10 06:20:58,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1147 GetRequests, 1115 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:20:58,793 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 3133 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3159 SdHoareTripleChecker+Valid, 3680 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:58,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3159 Valid, 3680 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2025-01-10 06:20:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1986. [2025-01-10 06:20:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1951 states have (on average 1.3972321886212198) internal successors, (2726), 1954 states have internal predecessors, (2726), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 06:20:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2786 transitions. [2025-01-10 06:20:58,824 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2786 transitions. Word has length 566 [2025-01-10 06:20:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:58,825 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2786 transitions. [2025-01-10 06:20:58,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.17391304347826) internal successors, (809), 23 states have internal predecessors, (809), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2786 transitions. [2025-01-10 06:20:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2025-01-10 06:20:58,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:58,839 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:58,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:20:59,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 06:20:59,045 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:59,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:59,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1677523929, now seen corresponding path program 3 times [2025-01-10 06:20:59,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:59,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622823145] [2025-01-10 06:20:59,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:20:59,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:59,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 800 statements into 12 equivalence classes. [2025-01-10 06:20:59,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 83 of 800 statements. [2025-01-10 06:20:59,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:20:59,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3506 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 2868 trivial. 0 not checked. [2025-01-10 06:20:59,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:59,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622823145] [2025-01-10 06:20:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622823145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:59,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:20:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819610076] [2025-01-10 06:20:59,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:59,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:20:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:59,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:20:59,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:20:59,439 INFO L87 Difference]: Start difference. First operand 1986 states and 2786 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:59,870 INFO L93 Difference]: Finished difference Result 4221 states and 5893 transitions. [2025-01-10 06:20:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:20:59,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 800 [2025-01-10 06:20:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:59,877 INFO L225 Difference]: With dead ends: 4221 [2025-01-10 06:20:59,877 INFO L226 Difference]: Without dead ends: 2326 [2025-01-10 06:20:59,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:20:59,881 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 14 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:59,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 832 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:20:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2025-01-10 06:20:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 2256. [2025-01-10 06:20:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2221 states have (on average 1.375956776226925) internal successors, (3056), 2224 states have internal predecessors, (3056), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 06:20:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3116 transitions. [2025-01-10 06:20:59,958 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3116 transitions. Word has length 800 [2025-01-10 06:20:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:59,959 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3116 transitions. [2025-01-10 06:20:59,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3116 transitions. [2025-01-10 06:20:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-01-10 06:20:59,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:59,965 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:59,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:20:59,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:59,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:59,966 INFO L85 PathProgramCache]: Analyzing trace with hash -408233043, now seen corresponding path program 1 times [2025-01-10 06:20:59,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:59,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192777395] [2025-01-10 06:20:59,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:00,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-01-10 06:21:00,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-01-10 06:21:00,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:00,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 3208 trivial. 0 not checked. [2025-01-10 06:21:01,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192777395] [2025-01-10 06:21:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192777395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:01,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:21:01,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:21:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333205162] [2025-01-10 06:21:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:01,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:21:01,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:01,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:21:01,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:21:01,143 INFO L87 Difference]: Start difference. First operand 2256 states and 3116 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:21:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:01,543 INFO L93 Difference]: Finished difference Result 4519 states and 6272 transitions. [2025-01-10 06:21:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:21:01,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 810 [2025-01-10 06:21:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:01,549 INFO L225 Difference]: With dead ends: 4519 [2025-01-10 06:21:01,549 INFO L226 Difference]: Without dead ends: 2386 [2025-01-10 06:21:01,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:21:01,552 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 15 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:01,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1002 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:21:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-01-10 06:21:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2356. [2025-01-10 06:21:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2321 states have (on average 1.3813011632916845) internal successors, (3206), 2324 states have internal predecessors, (3206), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 06:21:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3266 transitions. [2025-01-10 06:21:01,585 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3266 transitions. Word has length 810 [2025-01-10 06:21:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:01,585 INFO L471 AbstractCegarLoop]: Abstraction has 2356 states and 3266 transitions. [2025-01-10 06:21:01,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:21:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3266 transitions. [2025-01-10 06:21:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-01-10 06:21:01,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:01,591 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:21:01,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:21:01,592 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:21:01,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash -32440875, now seen corresponding path program 1 times [2025-01-10 06:21:01,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:01,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378451243] [2025-01-10 06:21:01,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:01,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:01,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes.