./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-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_SAX_nondet_test3-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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:24:47,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:24:47,288 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:24:47,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:24:47,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:24:47,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:24:47,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:24:47,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:24:47,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:24:47,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:24:47,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:24:47,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:24:47,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:24:47,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:24:47,320 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:24:47,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:24:47,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:24:47,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:24:47,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:24:47,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:24:47,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:24:47,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:24:47,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:24:47,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:24:47,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:24:47,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:24:47,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:24:47,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:24:47,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:24:47,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:24:47,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:24:47,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:24:47,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:24:47,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:24:47,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:24:47,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:24:47,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:24:47,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:24:47,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:24:47,324 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2025-01-10 06:24:47,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:24:47,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:24:47,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:24:47,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:24:47,544 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:24:47,544 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_SAX_nondet_test3-2.i [2025-01-10 06:24:48,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39605e9d4/b8b3cfbf421343d9af5792ebbb004436/FLAG7bc77609e [2025-01-10 06:24:48,963 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:24:48,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.i [2025-01-10 06:24:48,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39605e9d4/b8b3cfbf421343d9af5792ebbb004436/FLAG7bc77609e [2025-01-10 06:24:48,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39605e9d4/b8b3cfbf421343d9af5792ebbb004436 [2025-01-10 06:24:48,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:24:48,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:24:48,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:24:48,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:24:49,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:24:49,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:24:48" (1/1) ... [2025-01-10 06:24:49,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc8c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49, skipping insertion in model container [2025-01-10 06:24:49,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:24:48" (1/1) ... [2025-01-10 06:24:49,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:24:49,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:24:49,411 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:24:49,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:24:49,513 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:24:49,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49 WrapperNode [2025-01-10 06:24:49,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:24:49,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:24:49,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:24:49,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:24:49,518 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:24:49" (1/1) ... [2025-01-10 06:24:49,534 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:24:49" (1/1) ... [2025-01-10 06:24:49,576 INFO L138 Inliner]: procedures = 177, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1556 [2025-01-10 06:24:49,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:24:49,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:24:49,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:24:49,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:24:49,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,670 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 34, 266]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-01-10 06:24:49,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:24:49,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:24:49,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:24:49,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:24:49,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (1/1) ... [2025-01-10 06:24:49,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:24:49,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:24:49,782 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:24:49,784 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:24:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:24:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:24:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:24:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:24:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:24:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:24:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:24:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:24:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:24:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:24:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 06:24:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:24:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:24:49,824 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 06:24:49,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:24:49,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:24:49,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:24:49,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:24:49,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:24:49,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:24:49,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:24:49,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:24:49,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:24:49,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:24:49,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:24:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:24:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:24:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:24:49,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:24:50,001 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:24:50,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:24:51,121 INFO L? ?]: Removed 344 outVars from TransFormulas that were not future-live. [2025-01-10 06:24:51,121 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:24:51,137 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:24:51,137 INFO L312 CfgBuilder]: Removed 35 assume(true) statements. [2025-01-10 06:24:51,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:24:51 BoogieIcfgContainer [2025-01-10 06:24:51,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:24:51,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:24:51,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:24:51,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:24:51,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:24:48" (1/3) ... [2025-01-10 06:24:51,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb455ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:24:51, skipping insertion in model container [2025-01-10 06:24:51,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:24:49" (2/3) ... [2025-01-10 06:24:51,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb455ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:24:51, skipping insertion in model container [2025-01-10 06:24:51,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:24:51" (3/3) ... [2025-01-10 06:24:51,145 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test3-2.i [2025-01-10 06:24:51,153 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:24:51,155 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test3-2.i that has 5 procedures, 452 locations, 1 initial locations, 43 loop locations, and 6 error locations. [2025-01-10 06:24:51,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:24:51,204 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;@51e8043b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:24:51,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:24:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 444 states, 430 states have (on average 1.6186046511627907) internal successors, (696), 437 states have internal predecessors, (696), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 06:24:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 06:24:51,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:51,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:24:51,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:24:51,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash 223901251, now seen corresponding path program 1 times [2025-01-10 06:24:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245718020] [2025-01-10 06:24:51,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:51,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:24:51,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:24:51,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:51,319 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:24:51,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245718020] [2025-01-10 06:24:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245718020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:24:51,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:24:51,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:24:51,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305244782] [2025-01-10 06:24:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:24:51,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:24:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:24:51,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:24:51,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:24:51,340 INFO L87 Difference]: Start difference. First operand has 444 states, 430 states have (on average 1.6186046511627907) internal successors, (696), 437 states have internal predecessors, (696), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:24:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:24:51,388 INFO L93 Difference]: Finished difference Result 884 states and 1409 transitions. [2025-01-10 06:24:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:24:51,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 06:24:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:24:51,400 INFO L225 Difference]: With dead ends: 884 [2025-01-10 06:24:51,401 INFO L226 Difference]: Without dead ends: 402 [2025-01-10 06:24:51,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:24:51,405 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:24:51,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:24:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-01-10 06:24:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-01-10 06:24:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 390 states have (on average 1.4564102564102563) internal successors, (568), 396 states have internal predecessors, (568), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:24:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 576 transitions. [2025-01-10 06:24:51,447 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 576 transitions. Word has length 9 [2025-01-10 06:24:51,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:24:51,447 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 576 transitions. [2025-01-10 06:24:51,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:24:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 576 transitions. [2025-01-10 06:24:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 06:24:51,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:51,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:24:51,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:24:51,448 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:24:51,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash 223903173, now seen corresponding path program 1 times [2025-01-10 06:24:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329862399] [2025-01-10 06:24:51,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:51,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:24:51,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:24:51,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:51,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:24:51,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641886994] [2025-01-10 06:24:51,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:51,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:24:51,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:24:51,489 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:24:51,491 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:24:51,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:24:51,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:24:51,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:51,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:51,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:24:51,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:24:51,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:24:51,691 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:24:51,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:24:51,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:51,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329862399] [2025-01-10 06:24:51,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:24:51,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641886994] [2025-01-10 06:24:51,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641886994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:24:51,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:24:51,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:24:51,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165341972] [2025-01-10 06:24:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:24:51,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:24:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:24:51,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:24:51,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:24:51,695 INFO L87 Difference]: Start difference. First operand 402 states and 576 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:24:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:24:51,812 INFO L93 Difference]: Finished difference Result 793 states and 1142 transitions. [2025-01-10 06:24:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:24:51,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 06:24:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:24:51,817 INFO L225 Difference]: With dead ends: 793 [2025-01-10 06:24:51,818 INFO L226 Difference]: Without dead ends: 791 [2025-01-10 06:24:51,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:24:51,820 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 550 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:24:51,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1652 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:24:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-01-10 06:24:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 409. [2025-01-10 06:24:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 397 states have (on average 1.45088161209068) internal successors, (576), 403 states have internal predecessors, (576), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:24:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 584 transitions. [2025-01-10 06:24:51,869 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 584 transitions. Word has length 9 [2025-01-10 06:24:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:24:51,869 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 584 transitions. [2025-01-10 06:24:51,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:24:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 584 transitions. [2025-01-10 06:24:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 06:24:51,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:51,872 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] [2025-01-10 06:24:51,879 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:24:52,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:24:52,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:24:52,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1347158051, now seen corresponding path program 1 times [2025-01-10 06:24:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976519721] [2025-01-10 06:24:52,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:52,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 06:24:52,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 06:24:52,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:52,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:52,337 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:24:52,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:52,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976519721] [2025-01-10 06:24:52,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976519721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:24:52,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:24:52,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:24:52,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610201369] [2025-01-10 06:24:52,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:24:52,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:24:52,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:24:52,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:24:52,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:24:52,340 INFO L87 Difference]: Start difference. First operand 409 states and 584 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:24:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:24:52,400 INFO L93 Difference]: Finished difference Result 603 states and 864 transitions. [2025-01-10 06:24:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:24:52,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2025-01-10 06:24:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:24:52,402 INFO L225 Difference]: With dead ends: 603 [2025-01-10 06:24:52,402 INFO L226 Difference]: Without dead ends: 412 [2025-01-10 06:24:52,402 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:24:52,403 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 105 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1554 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:24:52,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1554 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:24:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-10 06:24:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 409. [2025-01-10 06:24:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 397 states have (on average 1.433249370277078) internal successors, (569), 403 states have internal predecessors, (569), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 06:24:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 577 transitions. [2025-01-10 06:24:52,413 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 577 transitions. Word has length 70 [2025-01-10 06:24:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:24:52,413 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 577 transitions. [2025-01-10 06:24:52,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:24:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 577 transitions. [2025-01-10 06:24:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 06:24:52,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:52,416 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] [2025-01-10 06:24:52,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:24:52,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:24:52,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1114072273, now seen corresponding path program 1 times [2025-01-10 06:24:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745591248] [2025-01-10 06:24:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:52,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 06:24:52,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 06:24:52,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:52,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:52,566 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:24:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745591248] [2025-01-10 06:24:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745591248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:24:52,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:24:52,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:24:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335640608] [2025-01-10 06:24:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:24:52,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:24:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:24:52,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:24:52,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:24:52,568 INFO L87 Difference]: Start difference. First operand 409 states and 577 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:24:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:24:52,584 INFO L93 Difference]: Finished difference Result 600 states and 847 transitions. [2025-01-10 06:24:52,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:24:52,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2025-01-10 06:24:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:24:52,587 INFO L225 Difference]: With dead ends: 600 [2025-01-10 06:24:52,587 INFO L226 Difference]: Without dead ends: 404 [2025-01-10 06:24:52,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:24:52,588 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 0 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:24:52,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1696 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:24:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-10 06:24:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-01-10 06:24:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.4340101522842639) internal successors, (565), 399 states have internal predecessors, (565), 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:24:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 571 transitions. [2025-01-10 06:24:52,603 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 571 transitions. Word has length 70 [2025-01-10 06:24:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:24:52,604 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 571 transitions. [2025-01-10 06:24:52,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:24:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 571 transitions. [2025-01-10 06:24:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 06:24:52,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:52,610 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] [2025-01-10 06:24:52,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:24:52,610 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:24:52,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:52,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2126153828, now seen corresponding path program 1 times [2025-01-10 06:24:52,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:52,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471245296] [2025-01-10 06:24:52,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:52,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 06:24:52,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 06:24:52,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:52,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:52,736 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:24:52,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:52,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471245296] [2025-01-10 06:24:52,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471245296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:24:52,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:24:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:24:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071705709] [2025-01-10 06:24:52,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:24:52,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:24:52,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:24:52,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:24:52,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:24:52,740 INFO L87 Difference]: Start difference. First operand 404 states and 571 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:24:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:24:52,771 INFO L93 Difference]: Finished difference Result 597 states and 843 transitions. [2025-01-10 06:24:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:24:52,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-01-10 06:24:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:24:52,774 INFO L225 Difference]: With dead ends: 597 [2025-01-10 06:24:52,774 INFO L226 Difference]: Without dead ends: 404 [2025-01-10 06:24:52,774 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:24:52,775 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 15 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:24:52,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1098 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:24:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-10 06:24:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-01-10 06:24:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.4238578680203047) internal successors, (561), 399 states have internal predecessors, (561), 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:24:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 567 transitions. [2025-01-10 06:24:52,792 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 567 transitions. Word has length 71 [2025-01-10 06:24:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:24:52,793 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 567 transitions. [2025-01-10 06:24:52,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:24:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 567 transitions. [2025-01-10 06:24:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 06:24:52,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:52,795 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, 1, 1, 1] [2025-01-10 06:24:52,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:24:52,795 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:24:52,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 157669932, now seen corresponding path program 1 times [2025-01-10 06:24:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:52,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305069029] [2025-01-10 06:24:52,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:52,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 06:24:52,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 06:24:52,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:52,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:52,943 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:24:52,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:52,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305069029] [2025-01-10 06:24:52,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305069029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:24:52,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:24:52,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:24:52,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675104575] [2025-01-10 06:24:52,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:24:52,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:24:52,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:24:52,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:24:52,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:24:52,945 INFO L87 Difference]: Start difference. First operand 404 states and 567 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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:24:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:24:53,007 INFO L93 Difference]: Finished difference Result 818 states and 1153 transitions. [2025-01-10 06:24:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:24:53,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-01-10 06:24:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:24:53,009 INFO L225 Difference]: With dead ends: 818 [2025-01-10 06:24:53,009 INFO L226 Difference]: Without dead ends: 424 [2025-01-10 06:24:53,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:24:53,011 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 8 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:24:53,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1063 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:24:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-10 06:24:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-01-10 06:24:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 414 states have (on average 1.4033816425120773) internal successors, (581), 419 states have internal predecessors, (581), 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:24:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 587 transitions. [2025-01-10 06:24:53,028 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 587 transitions. Word has length 82 [2025-01-10 06:24:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:24:53,029 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 587 transitions. [2025-01-10 06:24:53,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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:24:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 587 transitions. [2025-01-10 06:24:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 06:24:53,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:53,030 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, 1, 1, 1] [2025-01-10 06:24:53,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:24:53,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:24:53,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:53,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1834202928, now seen corresponding path program 1 times [2025-01-10 06:24:53,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:53,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924486523] [2025-01-10 06:24:53,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:53,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:53,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 06:24:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 06:24:53,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:53,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:53,200 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:24:53,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924486523] [2025-01-10 06:24:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924486523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:24:53,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:24:53,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:24:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359330201] [2025-01-10 06:24:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:24:53,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:24:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:24:53,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:24:53,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:24:53,203 INFO L87 Difference]: Start difference. First operand 424 states and 587 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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:24:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:24:53,264 INFO L93 Difference]: Finished difference Result 776 states and 1074 transitions. [2025-01-10 06:24:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:24:53,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-01-10 06:24:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:24:53,266 INFO L225 Difference]: With dead ends: 776 [2025-01-10 06:24:53,266 INFO L226 Difference]: Without dead ends: 362 [2025-01-10 06:24:53,267 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:24:53,267 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 32 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:24:53,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1351 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:24:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-01-10 06:24:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-01-10 06:24:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.3664772727272727) internal successors, (481), 357 states have internal predecessors, (481), 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:24:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 487 transitions. [2025-01-10 06:24:53,277 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 487 transitions. Word has length 82 [2025-01-10 06:24:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:24:53,277 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 487 transitions. [2025-01-10 06:24:53,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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:24:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 487 transitions. [2025-01-10 06:24:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 06:24:53,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:53,279 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, 1, 1, 1] [2025-01-10 06:24:53,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:24:53,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:24:53,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash -937684510, now seen corresponding path program 1 times [2025-01-10 06:24:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:53,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218915142] [2025-01-10 06:24:53,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:53,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 06:24:53,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 06:24:53,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:53,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:53,423 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:24:53,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218915142] [2025-01-10 06:24:53,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218915142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:24:53,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:24:53,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:24:53,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131053484] [2025-01-10 06:24:53,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:24:53,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:24:53,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:24:53,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:24:53,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:24:53,426 INFO L87 Difference]: Start difference. First operand 362 states and 487 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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:24:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:24:53,477 INFO L93 Difference]: Finished difference Result 935 states and 1272 transitions. [2025-01-10 06:24:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:24:53,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-01-10 06:24:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:24:53,480 INFO L225 Difference]: With dead ends: 935 [2025-01-10 06:24:53,480 INFO L226 Difference]: Without dead ends: 454 [2025-01-10 06:24:53,481 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:24:53,481 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 254 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:24:53,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 928 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:24:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-01-10 06:24:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 452. [2025-01-10 06:24:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 442 states have (on average 1.3552036199095023) internal successors, (599), 447 states have internal predecessors, (599), 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:24:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 605 transitions. [2025-01-10 06:24:53,491 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 605 transitions. Word has length 82 [2025-01-10 06:24:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:24:53,491 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 605 transitions. [2025-01-10 06:24:53,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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:24:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 605 transitions. [2025-01-10 06:24:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 06:24:53,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:53,492 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] [2025-01-10 06:24:53,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:24:53,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:24:53,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:53,493 INFO L85 PathProgramCache]: Analyzing trace with hash 173183480, now seen corresponding path program 1 times [2025-01-10 06:24:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:53,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661715259] [2025-01-10 06:24:53,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:53,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:53,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 06:24:53,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 06:24:53,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:53,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:53,780 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:24:53,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:53,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661715259] [2025-01-10 06:24:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661715259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:24:53,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:24:53,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:24:53,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692030991] [2025-01-10 06:24:53,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:24:53,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:24:53,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:24:53,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:24:53,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:24:53,781 INFO L87 Difference]: Start difference. First operand 452 states and 605 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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:24:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:24:53,858 INFO L93 Difference]: Finished difference Result 710 states and 958 transitions. [2025-01-10 06:24:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:24:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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 97 [2025-01-10 06:24:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:24:53,861 INFO L225 Difference]: With dead ends: 710 [2025-01-10 06:24:53,861 INFO L226 Difference]: Without dead ends: 708 [2025-01-10 06:24:53,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:24:53,862 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 371 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:24:53,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1378 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:24:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-01-10 06:24:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 516. [2025-01-10 06:24:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 503 states have (on average 1.345924453280318) internal successors, (677), 508 states have internal predecessors, (677), 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:24:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 689 transitions. [2025-01-10 06:24:53,874 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 689 transitions. Word has length 97 [2025-01-10 06:24:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:24:53,875 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 689 transitions. [2025-01-10 06:24:53,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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:24:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 689 transitions. [2025-01-10 06:24:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 06:24:53,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:53,875 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:53,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:24:53,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:24:53,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:53,876 INFO L85 PathProgramCache]: Analyzing trace with hash 498962241, now seen corresponding path program 1 times [2025-01-10 06:24:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:53,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087679933] [2025-01-10 06:24:53,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:53,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:53,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:24:54,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:24:54,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:54,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:24:54,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:54,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087679933] [2025-01-10 06:24:54,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087679933] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:24:54,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191678633] [2025-01-10 06:24:54,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:54,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:24:54,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:24:54,206 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:24:54,208 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:24:54,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:24:54,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:24:54,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:54,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:54,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 06:24:54,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:24:54,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:24:54,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:24:54,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-10 06:24:54,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:24:54,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-01-10 06:24:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:24:55,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:24:55,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191678633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:24:55,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:24:55,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-10 06:24:55,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117992335] [2025-01-10 06:24:55,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:24:55,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:24:55,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:24:55,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:24:55,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:24:55,062 INFO L87 Difference]: Start difference. First operand 516 states and 689 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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:24:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:24:56,088 INFO L93 Difference]: Finished difference Result 1179 states and 1596 transitions. [2025-01-10 06:24:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:24:56,088 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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 104 [2025-01-10 06:24:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:24:56,090 INFO L225 Difference]: With dead ends: 1179 [2025-01-10 06:24:56,091 INFO L226 Difference]: Without dead ends: 710 [2025-01-10 06:24:56,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:24:56,092 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 574 mSDsluCounter, 2519 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 06:24:56,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 3012 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 06:24:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-01-10 06:24:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 516. [2025-01-10 06:24:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 503 states have (on average 1.3439363817097416) internal successors, (676), 508 states have internal predecessors, (676), 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:24:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 688 transitions. [2025-01-10 06:24:56,105 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 688 transitions. Word has length 104 [2025-01-10 06:24:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:24:56,105 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 688 transitions. [2025-01-10 06:24:56,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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:24:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 688 transitions. [2025-01-10 06:24:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 06:24:56,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:24:56,106 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:56,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:24:56,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:24:56,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:24:56,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:24:56,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2047218234, now seen corresponding path program 1 times [2025-01-10 06:24:56,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:24:56,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910287369] [2025-01-10 06:24:56,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:24:56,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:24:56,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:24:56,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:56,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:24:56,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:24:56,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910287369] [2025-01-10 06:24:56,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910287369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:24:56,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017240784] [2025-01-10 06:24:56,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:24:56,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:24:56,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:24:56,585 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:24:56,587 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:24:56,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:24:56,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:24:56,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:24:56,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:24:56,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:24:56,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:24,603 WARN L286 SmtUtils]: Spent 9.19s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)