./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.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_test10-1.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 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:25:28,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:25:28,161 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:25:28,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:25:28,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:25:28,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:25:28,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:25:28,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:25:28,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:25:28,199 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:25:28,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:25:28,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:25:28,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:25:28,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:25:28,202 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:25:28,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:25:28,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:25:28,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:25:28,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:25:28,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:25:28,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:25:28,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:25:28,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:25:28,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:25:28,203 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:25:28,203 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:25:28,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:25:28,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:25:28,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:25:28,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:25:28,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:25:28,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:25:28,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:25:28,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:25:28,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:25:28,205 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 -> 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 [2025-01-10 06:25:28,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:25:28,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:25:28,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:25:28,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:25:28,482 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:25:28,483 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_test10-1.i [2025-01-10 06:25:29,755 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13a0b8183/0ed94b8fcf5a4aad8f96d23a148e9dc5/FLAGd0e5f23f3 [2025-01-10 06:25:30,202 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:25:30,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2025-01-10 06:25:30,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13a0b8183/0ed94b8fcf5a4aad8f96d23a148e9dc5/FLAGd0e5f23f3 [2025-01-10 06:25:30,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13a0b8183/0ed94b8fcf5a4aad8f96d23a148e9dc5 [2025-01-10 06:25:30,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:25:30,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:25:30,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:25:30,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:25:30,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:25:30,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:25:30" (1/1) ... [2025-01-10 06:25:30,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73aa1b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:30, skipping insertion in model container [2025-01-10 06:25:30,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:25:30" (1/1) ... [2025-01-10 06:25:30,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:25:30,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:25:30,837 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:25:31,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:25:31,038 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:25:31,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31 WrapperNode [2025-01-10 06:25:31,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:25:31,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:25:31,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:25:31,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:25:31,046 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:25:31" (1/1) ... [2025-01-10 06:25:31,082 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:25:31" (1/1) ... [2025-01-10 06:25:31,190 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3314 [2025-01-10 06:25:31,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:25:31,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:25:31,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:25:31,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:25:31,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,392 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 82, 4]. [2025-01-10 06:25:31,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,462 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:25:31,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:25:31,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:25:31,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:25:31,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (1/1) ... [2025-01-10 06:25:31,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:25:31,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:31,593 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:25:31,597 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:25:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-01-10 06:25:31,620 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-01-10 06:25:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:25:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:25:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:25:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:25:31,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:25:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:25:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:25:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:25:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:25:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:25:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 06:25:31,621 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:25:31,622 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:25:31,622 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 06:25:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:25:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:25:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:25:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:25:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:25:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:25:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:25:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:25:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:25:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:25:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:25:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:25:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:25:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:25:31,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:25:31,915 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:25:31,917 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:25:34,640 INFO L? ?]: Removed 789 outVars from TransFormulas that were not future-live. [2025-01-10 06:25:34,640 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:25:34,679 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:25:34,682 INFO L312 CfgBuilder]: Removed 73 assume(true) statements. [2025-01-10 06:25:34,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:25:34 BoogieIcfgContainer [2025-01-10 06:25:34,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:25:34,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:25:34,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:25:34,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:25:34,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:25:30" (1/3) ... [2025-01-10 06:25:34,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38032891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:25:34, skipping insertion in model container [2025-01-10 06:25:34,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:31" (2/3) ... [2025-01-10 06:25:34,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38032891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:25:34, skipping insertion in model container [2025-01-10 06:25:34,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:25:34" (3/3) ... [2025-01-10 06:25:34,692 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-1.i [2025-01-10 06:25:34,705 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:25:34,706 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test10-1.i that has 6 procedures, 1045 locations, 1 initial locations, 84 loop locations, and 6 error locations. [2025-01-10 06:25:34,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:25:34,814 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;@2347fe41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:25:34,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:25:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1013 states have (on average 1.6209279368213227) internal successors, (1642), 1023 states have internal predecessors, (1642), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-10 06:25:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 06:25:34,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:34,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:25:34,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:34,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash 778151221, now seen corresponding path program 1 times [2025-01-10 06:25:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725831338] [2025-01-10 06:25:34,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:34,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:25:34,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:25:34,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:34,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:35,001 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:25:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725831338] [2025-01-10 06:25:35,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725831338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:35,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:35,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:25:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217587802] [2025-01-10 06:25:35,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:35,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:25:35,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:35,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:25:35,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:25:35,034 INFO L87 Difference]: Start difference. First operand has 1037 states, 1013 states have (on average 1.6209279368213227) internal successors, (1642), 1023 states have internal predecessors, (1642), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:25:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:35,140 INFO L93 Difference]: Finished difference Result 2071 states and 3345 transitions. [2025-01-10 06:25:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:25:35,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:25:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:35,167 INFO L225 Difference]: With dead ends: 2071 [2025-01-10 06:25:35,167 INFO L226 Difference]: Without dead ends: 1031 [2025-01-10 06:25:35,176 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:25:35,180 INFO L435 NwaCegarLoop]: 1521 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, 1521 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:25:35,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:25:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-01-10 06:25:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2025-01-10 06:25:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 1008 states have (on average 1.4771825396825398) internal successors, (1489), 1018 states have internal predecessors, (1489), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:25:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1516 transitions. [2025-01-10 06:25:35,314 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1516 transitions. Word has length 9 [2025-01-10 06:25:35,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:35,315 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1516 transitions. [2025-01-10 06:25:35,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:25:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1516 transitions. [2025-01-10 06:25:35,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:25:35,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:35,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:25:35,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:25:35,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:35,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:35,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1221552212, now seen corresponding path program 1 times [2025-01-10 06:25:35,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:35,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555741346] [2025-01-10 06:25:35,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:35,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:35,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:25:35,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:25:35,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:35,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:25:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509760177] [2025-01-10 06:25:35,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:35,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:35,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:35,383 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:25:35,385 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:25:35,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:25:35,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:25:35,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:35,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:35,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:25:35,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:35,647 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:25:35,677 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:25:35,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:25:35,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:35,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555741346] [2025-01-10 06:25:35,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:25:35,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509760177] [2025-01-10 06:25:35,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509760177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:35,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:35,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:25:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240550206] [2025-01-10 06:25:35,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:35,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:35,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:35,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:25:35,682 INFO L87 Difference]: Start difference. First operand 1031 states and 1516 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:25:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:35,882 INFO L93 Difference]: Finished difference Result 1425 states and 2086 transitions. [2025-01-10 06:25:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:25:35,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 06:25:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:35,890 INFO L225 Difference]: With dead ends: 1425 [2025-01-10 06:25:35,890 INFO L226 Difference]: Without dead ends: 1423 [2025-01-10 06:25:35,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:25:35,891 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 551 mSDsluCounter, 2995 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 4547 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:35,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 4547 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-01-10 06:25:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1038. [2025-01-10 06:25:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1015 states have (on average 1.4748768472906404) internal successors, (1497), 1025 states have internal predecessors, (1497), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:25:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1524 transitions. [2025-01-10 06:25:35,958 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1524 transitions. Word has length 8 [2025-01-10 06:25:35,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:35,958 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1524 transitions. [2025-01-10 06:25:35,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:25:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1524 transitions. [2025-01-10 06:25:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 06:25:35,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:35,963 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] [2025-01-10 06:25:35,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:25:36,167 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:25:36,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:36,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash 789775861, now seen corresponding path program 1 times [2025-01-10 06:25:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:36,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411841888] [2025-01-10 06:25:36,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:36,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:36,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 06:25:36,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 06:25:36,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:36,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:36,657 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:25:36,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:36,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411841888] [2025-01-10 06:25:36,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411841888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:36,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:36,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:25:36,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686492587] [2025-01-10 06:25:36,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:36,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:36,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:36,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:36,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:25:36,660 INFO L87 Difference]: Start difference. First operand 1038 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:25:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:36,848 INFO L93 Difference]: Finished difference Result 2054 states and 3024 transitions. [2025-01-10 06:25:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:25:36,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-10 06:25:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:36,857 INFO L225 Difference]: With dead ends: 2054 [2025-01-10 06:25:36,857 INFO L226 Difference]: Without dead ends: 1422 [2025-01-10 06:25:36,859 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:25:36,861 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 553 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 4550 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:36,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 4550 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-01-10 06:25:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1038. [2025-01-10 06:25:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1015 states have (on average 1.4738916256157635) internal successors, (1496), 1025 states have internal predecessors, (1496), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:25:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1523 transitions. [2025-01-10 06:25:36,901 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1523 transitions. Word has length 63 [2025-01-10 06:25:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:36,901 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1523 transitions. [2025-01-10 06:25:36,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:25:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1523 transitions. [2025-01-10 06:25:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 06:25:36,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:36,908 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:25:36,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:25:36,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:36,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:36,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1686256326, now seen corresponding path program 1 times [2025-01-10 06:25:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:36,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39685563] [2025-01-10 06:25:36,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:36,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 06:25:36,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 06:25:36,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:36,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:37,383 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:25:37,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:37,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39685563] [2025-01-10 06:25:37,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39685563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:37,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:37,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:25:37,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117096086] [2025-01-10 06:25:37,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:37,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:37,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:37,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:37,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:25:37,384 INFO L87 Difference]: Start difference. First operand 1038 states and 1523 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:25:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:37,573 INFO L93 Difference]: Finished difference Result 2451 states and 3596 transitions. [2025-01-10 06:25:37,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:25:37,573 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:25:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:37,580 INFO L225 Difference]: With dead ends: 2451 [2025-01-10 06:25:37,580 INFO L226 Difference]: Without dead ends: 1422 [2025-01-10 06:25:37,582 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:25:37,582 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 546 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 4550 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:37,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 4550 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-01-10 06:25:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1039. [2025-01-10 06:25:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1016 states have (on average 1.4734251968503937) internal successors, (1497), 1026 states have internal predecessors, (1497), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:25:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1524 transitions. [2025-01-10 06:25:37,611 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1524 transitions. Word has length 82 [2025-01-10 06:25:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:37,611 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1524 transitions. [2025-01-10 06:25:37,612 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:25:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1524 transitions. [2025-01-10 06:25:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-10 06:25:37,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:37,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:37,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:25:37,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:37,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1102665099, now seen corresponding path program 1 times [2025-01-10 06:25:37,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:37,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403307073] [2025-01-10 06:25:37,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:37,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:37,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-10 06:25:37,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-10 06:25:37,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:37,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:37,926 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:25:37,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:37,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403307073] [2025-01-10 06:25:37,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403307073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:37,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:37,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:25:37,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233119631] [2025-01-10 06:25:37,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:37,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:25:37,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:37,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:25:37,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:25:37,932 INFO L87 Difference]: Start difference. First operand 1039 states and 1524 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:25:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:38,039 INFO L93 Difference]: Finished difference Result 2088 states and 3068 transitions. [2025-01-10 06:25:38,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:25:38,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 152 [2025-01-10 06:25:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:38,045 INFO L225 Difference]: With dead ends: 2088 [2025-01-10 06:25:38,046 INFO L226 Difference]: Without dead ends: 1059 [2025-01-10 06:25:38,047 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:25:38,049 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 9 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2977 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:25:38,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2977 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-01-10 06:25:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2025-01-10 06:25:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1036 states have (on average 1.4642857142857142) internal successors, (1517), 1046 states have internal predecessors, (1517), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:25:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1544 transitions. [2025-01-10 06:25:38,087 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1544 transitions. Word has length 152 [2025-01-10 06:25:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:38,089 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1544 transitions. [2025-01-10 06:25:38,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:25:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1544 transitions. [2025-01-10 06:25:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-10 06:25:38,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:38,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:38,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:25:38,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:38,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1559782001, now seen corresponding path program 1 times [2025-01-10 06:25:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282353779] [2025-01-10 06:25:38,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:38,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-10 06:25:38,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-10 06:25:38,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:38,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:38,403 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:25:38,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:38,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282353779] [2025-01-10 06:25:38,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282353779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:38,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:38,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:25:38,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938878441] [2025-01-10 06:25:38,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:38,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:38,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:38,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:25:38,406 INFO L87 Difference]: Start difference. First operand 1059 states and 1544 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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:25:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:38,503 INFO L93 Difference]: Finished difference Result 2094 states and 3064 transitions. [2025-01-10 06:25:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:25:38,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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 152 [2025-01-10 06:25:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:38,511 INFO L225 Difference]: With dead ends: 2094 [2025-01-10 06:25:38,511 INFO L226 Difference]: Without dead ends: 1045 [2025-01-10 06:25:38,513 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:25:38,514 INFO L435 NwaCegarLoop]: 1489 mSDtfsCounter, 105 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 4374 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.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:38,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 4374 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-01-10 06:25:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1045. [2025-01-10 06:25:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1022 states have (on average 1.4637964774951076) internal successors, (1496), 1032 states have internal predecessors, (1496), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:25:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1523 transitions. [2025-01-10 06:25:38,566 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1523 transitions. Word has length 152 [2025-01-10 06:25:38,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:38,567 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1523 transitions. [2025-01-10 06:25:38,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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:25:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1523 transitions. [2025-01-10 06:25:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-10 06:25:38,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:38,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:38,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:25:38,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:38,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:38,572 INFO L85 PathProgramCache]: Analyzing trace with hash -650700095, now seen corresponding path program 1 times [2025-01-10 06:25:38,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:38,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443595130] [2025-01-10 06:25:38,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:38,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-10 06:25:38,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-10 06:25:38,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:38,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:38,778 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:25:38,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:38,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443595130] [2025-01-10 06:25:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443595130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:38,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:25:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807543769] [2025-01-10 06:25:38,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:38,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:25:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:38,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:25:38,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:25:38,780 INFO L87 Difference]: Start difference. First operand 1045 states and 1523 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:25:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:38,886 INFO L93 Difference]: Finished difference Result 2655 states and 3891 transitions. [2025-01-10 06:25:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:25:38,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 152 [2025-01-10 06:25:38,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:38,897 INFO L225 Difference]: With dead ends: 2655 [2025-01-10 06:25:38,897 INFO L226 Difference]: Without dead ends: 1620 [2025-01-10 06:25:38,899 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:25:38,900 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 789 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:38,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 2996 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-01-10 06:25:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1462. [2025-01-10 06:25:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1437 states have (on average 1.4690327070285316) internal successors, (2111), 1447 states have internal predecessors, (2111), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-10 06:25:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2142 transitions. [2025-01-10 06:25:38,947 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2142 transitions. Word has length 152 [2025-01-10 06:25:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:38,949 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 2142 transitions. [2025-01-10 06:25:38,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:25:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2142 transitions. [2025-01-10 06:25:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-10 06:25:38,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:38,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:38,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:25:38,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:38,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:38,952 INFO L85 PathProgramCache]: Analyzing trace with hash -923428717, now seen corresponding path program 1 times [2025-01-10 06:25:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:38,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333230813] [2025-01-10 06:25:38,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:39,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-10 06:25:39,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-10 06:25:39,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:39,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:39,328 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:25:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:39,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333230813] [2025-01-10 06:25:39,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333230813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:39,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:39,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:25:39,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061875028] [2025-01-10 06:25:39,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:39,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:39,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:39,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:25:39,331 INFO L87 Difference]: Start difference. First operand 1462 states and 2142 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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:25:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:39,439 INFO L93 Difference]: Finished difference Result 2740 states and 4017 transitions. [2025-01-10 06:25:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:25:39,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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 167 [2025-01-10 06:25:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:39,449 INFO L225 Difference]: With dead ends: 2740 [2025-01-10 06:25:39,449 INFO L226 Difference]: Without dead ends: 1420 [2025-01-10 06:25:39,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:25:39,453 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 30 mSDsluCounter, 2796 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4203 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:39,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4203 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-01-10 06:25:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2025-01-10 06:25:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1395 states have (on average 1.4580645161290322) internal successors, (2034), 1405 states have internal predecessors, (2034), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-10 06:25:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2065 transitions. [2025-01-10 06:25:39,495 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2065 transitions. Word has length 167 [2025-01-10 06:25:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:39,496 INFO L471 AbstractCegarLoop]: Abstraction has 1420 states and 2065 transitions. [2025-01-10 06:25:39,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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:25:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2065 transitions. [2025-01-10 06:25:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-10 06:25:39,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:39,499 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:39,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:25:39,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:39,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1701761211, now seen corresponding path program 1 times [2025-01-10 06:25:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:39,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128682564] [2025-01-10 06:25:39,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:39,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-10 06:25:39,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-10 06:25:39,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:39,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:39,777 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:25:39,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128682564] [2025-01-10 06:25:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128682564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:39,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:39,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:25:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639236210] [2025-01-10 06:25:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:39,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:25:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:39,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:25:39,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:25:39,780 INFO L87 Difference]: Start difference. First operand 1420 states and 2065 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:25:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:39,846 INFO L93 Difference]: Finished difference Result 2698 states and 3929 transitions. [2025-01-10 06:25:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:25:39,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 167 [2025-01-10 06:25:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:39,853 INFO L225 Difference]: With dead ends: 2698 [2025-01-10 06:25:39,854 INFO L226 Difference]: Without dead ends: 1420 [2025-01-10 06:25:39,856 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:25:39,856 INFO L435 NwaCegarLoop]: 1420 mSDtfsCounter, 1 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:39,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2818 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:25:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-01-10 06:25:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2025-01-10 06:25:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1395 states have (on average 1.4559139784946236) internal successors, (2031), 1405 states have internal predecessors, (2031), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-10 06:25:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2062 transitions. [2025-01-10 06:25:39,894 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2062 transitions. Word has length 167 [2025-01-10 06:25:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:39,895 INFO L471 AbstractCegarLoop]: Abstraction has 1420 states and 2062 transitions. [2025-01-10 06:25:39,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:25:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2062 transitions. [2025-01-10 06:25:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-10 06:25:39,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:39,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:39,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:25:39,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:39,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:39,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1135124297, now seen corresponding path program 1 times [2025-01-10 06:25:39,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:39,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628931230] [2025-01-10 06:25:39,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:39,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:39,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-10 06:25:40,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-10 06:25:40,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:40,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:40,209 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:25:40,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:40,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628931230] [2025-01-10 06:25:40,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628931230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:40,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:25:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248902611] [2025-01-10 06:25:40,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:40,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:25:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:40,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:25:40,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:25:40,211 INFO L87 Difference]: Start difference. First operand 1420 states and 2062 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:25:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:40,333 INFO L93 Difference]: Finished difference Result 3265 states and 4750 transitions. [2025-01-10 06:25:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:25:40,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 167 [2025-01-10 06:25:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:40,345 INFO L225 Difference]: With dead ends: 3265 [2025-01-10 06:25:40,346 INFO L226 Difference]: Without dead ends: 1987 [2025-01-10 06:25:40,348 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:25:40,349 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 671 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:40,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 3030 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-01-10 06:25:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1982. [2025-01-10 06:25:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1951 states have (on average 1.4551512045105075) internal successors, (2839), 1961 states have internal predecessors, (2839), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-10 06:25:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2882 transitions. [2025-01-10 06:25:40,407 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2882 transitions. Word has length 167 [2025-01-10 06:25:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:40,407 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2882 transitions. [2025-01-10 06:25:40,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:25:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2882 transitions. [2025-01-10 06:25:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-10 06:25:40,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:40,410 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:40,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:25:40,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:40,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:40,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1150526680, now seen corresponding path program 1 times [2025-01-10 06:25:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:40,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746693599] [2025-01-10 06:25:40,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:40,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:40,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-10 06:25:40,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-10 06:25:40,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:40,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:25:40,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:40,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746693599] [2025-01-10 06:25:40,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746693599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:40,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:40,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:25:40,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292038982] [2025-01-10 06:25:40,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:40,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:40,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:40,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:40,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:25:40,960 INFO L87 Difference]: Start difference. First operand 1982 states and 2882 transitions. Second operand has 4 states, 3 states have (on average 55.0) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:41,151 INFO L93 Difference]: Finished difference Result 2048 states and 2968 transitions. [2025-01-10 06:25:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:25:41,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 55.0) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2025-01-10 06:25:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:41,161 INFO L225 Difference]: With dead ends: 2048 [2025-01-10 06:25:41,161 INFO L226 Difference]: Without dead ends: 2046 [2025-01-10 06:25:41,162 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:25:41,162 INFO L435 NwaCegarLoop]: 1463 mSDtfsCounter, 297 mSDsluCounter, 2816 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 4279 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:41,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 4279 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2025-01-10 06:25:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2046. [2025-01-10 06:25:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 2012 states have (on average 1.4498011928429424) internal successors, (2917), 2022 states have internal predecessors, (2917), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 06:25:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2966 transitions. [2025-01-10 06:25:41,216 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2966 transitions. Word has length 182 [2025-01-10 06:25:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:41,216 INFO L471 AbstractCegarLoop]: Abstraction has 2046 states and 2966 transitions. [2025-01-10 06:25:41,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 55.0) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2966 transitions. [2025-01-10 06:25:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 06:25:41,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:41,218 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:41,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:25:41,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:41,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash -80887832, now seen corresponding path program 1 times [2025-01-10 06:25:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:41,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154738920] [2025-01-10 06:25:41,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:41,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:41,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:25:41,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:25:41,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:41,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:25:42,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:42,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154738920] [2025-01-10 06:25:42,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154738920] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:25:42,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102529159] [2025-01-10 06:25:42,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:42,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:42,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:42,373 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:25:42,375 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:25:42,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:25:43,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:25:43,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:43,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:43,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 06:25:43,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:43,053 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:25:43,075 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:25:43,090 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:25:43,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:25:43,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 43 [2025-01-10 06:25:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:25:43,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:25:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102529159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:43,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:25:43,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-10 06:25:43,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281964027] [2025-01-10 06:25:43,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:43,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:25:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:43,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:25:43,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:25:43,648 INFO L87 Difference]: Start difference. First operand 2046 states and 2966 transitions. Second operand has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:46,018 INFO L93 Difference]: Finished difference Result 4037 states and 5850 transitions. [2025-01-10 06:25:46,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:25:46,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2025-01-10 06:25:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:46,029 INFO L225 Difference]: With dead ends: 4037 [2025-01-10 06:25:46,029 INFO L226 Difference]: Without dead ends: 2086 [2025-01-10 06:25:46,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:25:46,033 INFO L435 NwaCegarLoop]: 1451 mSDtfsCounter, 737 mSDsluCounter, 8982 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 10433 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:46,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 10433 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-10 06:25:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2025-01-10 06:25:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2077. [2025-01-10 06:25:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 2043 states have (on average 1.4454233969652472) internal successors, (2953), 2053 states have internal predecessors, (2953), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 06:25:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 3002 transitions. [2025-01-10 06:25:46,089 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 3002 transitions. Word has length 189 [2025-01-10 06:25:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:46,089 INFO L471 AbstractCegarLoop]: Abstraction has 2077 states and 3002 transitions. [2025-01-10 06:25:46,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 3002 transitions. [2025-01-10 06:25:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 06:25:46,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:46,092 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:46,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:25:46,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:46,293 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:46,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1990363244, now seen corresponding path program 1 times [2025-01-10 06:25:46,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:46,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019441180] [2025-01-10 06:25:46,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:46,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:46,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:25:46,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:25:46,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:46,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:25:46,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:46,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019441180] [2025-01-10 06:25:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019441180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:25:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298960743] [2025-01-10 06:25:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:46,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:46,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:46,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:25:46,557 INFO L87 Difference]: Start difference. First operand 2077 states and 3002 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:46,635 INFO L93 Difference]: Finished difference Result 3980 states and 5762 transitions. [2025-01-10 06:25:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:25:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2025-01-10 06:25:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:46,644 INFO L225 Difference]: With dead ends: 3980 [2025-01-10 06:25:46,644 INFO L226 Difference]: Without dead ends: 1938 [2025-01-10 06:25:46,648 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:25:46,649 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 9 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:46,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3974 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:25:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-01-10 06:25:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2025-01-10 06:25:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1904 states have (on average 1.4411764705882353) internal successors, (2744), 1914 states have internal predecessors, (2744), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 06:25:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2793 transitions. [2025-01-10 06:25:46,705 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2793 transitions. Word has length 189 [2025-01-10 06:25:46,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:46,705 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 2793 transitions. [2025-01-10 06:25:46,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2793 transitions. [2025-01-10 06:25:46,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-10 06:25:46,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:46,708 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:46,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:25:46,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:46,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2108768083, now seen corresponding path program 1 times [2025-01-10 06:25:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:46,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595005709] [2025-01-10 06:25:46,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:46,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:25:47,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:25:47,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:47,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:25:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595005709] [2025-01-10 06:25:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595005709] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:25:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786845614] [2025-01-10 06:25:47,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:47,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:47,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:47,406 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:25:47,409 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:25:47,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:25:48,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:25:48,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:48,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:48,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:25:48,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:25:48,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:25:48,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786845614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:48,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:25:48,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:25:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434219512] [2025-01-10 06:25:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:48,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:48,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:48,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:48,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:25:48,186 INFO L87 Difference]: Start difference. First operand 1938 states and 2793 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:48,333 INFO L93 Difference]: Finished difference Result 3835 states and 5543 transitions. [2025-01-10 06:25:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:25:48,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2025-01-10 06:25:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:48,345 INFO L225 Difference]: With dead ends: 3835 [2025-01-10 06:25:48,345 INFO L226 Difference]: Without dead ends: 1938 [2025-01-10 06:25:48,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:25:48,350 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 13 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:48,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3884 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-01-10 06:25:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2025-01-10 06:25:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1904 states have (on average 1.440126050420168) internal successors, (2742), 1914 states have internal predecessors, (2742), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 06:25:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2791 transitions. [2025-01-10 06:25:48,416 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2791 transitions. Word has length 190 [2025-01-10 06:25:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:48,417 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 2791 transitions. [2025-01-10 06:25:48,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2791 transitions. [2025-01-10 06:25:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-10 06:25:48,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:48,423 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:48,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:25:48,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:48,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:48,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:48,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1709492131, now seen corresponding path program 1 times [2025-01-10 06:25:48,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:48,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485773049] [2025-01-10 06:25:48,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:48,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:48,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:25:48,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:25:48,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:48,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:25:49,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:49,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485773049] [2025-01-10 06:25:49,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485773049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:49,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:49,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:25:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860356032] [2025-01-10 06:25:49,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:49,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:25:49,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:49,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:25:49,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:25:49,156 INFO L87 Difference]: Start difference. First operand 1938 states and 2791 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:49,444 INFO L93 Difference]: Finished difference Result 3838 states and 5545 transitions. [2025-01-10 06:25:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:25:49,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2025-01-10 06:25:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:49,453 INFO L225 Difference]: With dead ends: 3838 [2025-01-10 06:25:49,453 INFO L226 Difference]: Without dead ends: 1944 [2025-01-10 06:25:49,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:25:49,456 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 4 mSDsluCounter, 5049 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6384 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:49,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6384 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:25:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2025-01-10 06:25:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1944. [2025-01-10 06:25:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1910 states have (on average 1.4387434554973821) internal successors, (2748), 1920 states have internal predecessors, (2748), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 06:25:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2797 transitions. [2025-01-10 06:25:49,506 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2797 transitions. Word has length 191 [2025-01-10 06:25:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:49,506 INFO L471 AbstractCegarLoop]: Abstraction has 1944 states and 2797 transitions. [2025-01-10 06:25:49,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2797 transitions. [2025-01-10 06:25:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-10 06:25:49,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:49,509 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:49,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:25:49,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:49,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1071018740, now seen corresponding path program 1 times [2025-01-10 06:25:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:49,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787953088] [2025-01-10 06:25:49,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:49,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:49,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:25:49,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:25:49,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:49,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:25:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787953088] [2025-01-10 06:25:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787953088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:49,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:25:49,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345043731] [2025-01-10 06:25:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:25:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:49,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:25:49,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:25:49,978 INFO L87 Difference]: Start difference. First operand 1944 states and 2797 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:50,323 INFO L93 Difference]: Finished difference Result 3844 states and 5549 transitions. [2025-01-10 06:25:50,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:25:50,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2025-01-10 06:25:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:50,340 INFO L225 Difference]: With dead ends: 3844 [2025-01-10 06:25:50,340 INFO L226 Difference]: Without dead ends: 1954 [2025-01-10 06:25:50,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:25:50,348 INFO L435 NwaCegarLoop]: 1325 mSDtfsCounter, 8 mSDsluCounter, 6310 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 7635 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:50,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 7635 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:25:50,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-01-10 06:25:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2025-01-10 06:25:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1918 states have (on average 1.437956204379562) internal successors, (2758), 1928 states have internal predecessors, (2758), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 06:25:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2807 transitions. [2025-01-10 06:25:50,399 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2807 transitions. Word has length 192 [2025-01-10 06:25:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:50,400 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 2807 transitions. [2025-01-10 06:25:50,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2807 transitions. [2025-01-10 06:25:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-10 06:25:50,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:50,403 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:50,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:25:50,403 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:50,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash 763373040, now seen corresponding path program 1 times [2025-01-10 06:25:50,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:50,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955675468] [2025-01-10 06:25:50,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:50,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:50,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:25:50,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:25:50,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:50,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:25:51,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:51,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955675468] [2025-01-10 06:25:51,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955675468] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:25:51,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452571525] [2025-01-10 06:25:51,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:51,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:51,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:51,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:25:51,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:25:51,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:25:52,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:25:52,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:52,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:52,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:25:52,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:25:52,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:25:52,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452571525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:52,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:25:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-10 06:25:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536203888] [2025-01-10 06:25:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:52,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:25:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:52,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:25:52,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:25:52,349 INFO L87 Difference]: Start difference. First operand 1952 states and 2807 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:52,721 INFO L93 Difference]: Finished difference Result 3856 states and 5564 transitions. [2025-01-10 06:25:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:25:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2025-01-10 06:25:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:52,735 INFO L225 Difference]: With dead ends: 3856 [2025-01-10 06:25:52,736 INFO L226 Difference]: Without dead ends: 1962 [2025-01-10 06:25:52,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:25:52,739 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 8 mSDsluCounter, 6311 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 7642 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:52,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 7642 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:25:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-10 06:25:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1952. [2025-01-10 06:25:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1918 states have (on average 1.437956204379562) internal successors, (2758), 1928 states have internal predecessors, (2758), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 06:25:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2807 transitions. [2025-01-10 06:25:52,784 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2807 transitions. Word has length 192 [2025-01-10 06:25:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:52,785 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 2807 transitions. [2025-01-10 06:25:52,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2807 transitions. [2025-01-10 06:25:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:25:52,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:52,787 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:52,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:25:52,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 06:25:52,991 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:52,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:52,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1463044055, now seen corresponding path program 1 times [2025-01-10 06:25:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:52,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663386329] [2025-01-10 06:25:52,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:52,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:53,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:25:53,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:25:53,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:53,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:25:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663386329] [2025-01-10 06:25:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663386329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:53,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:53,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:25:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36430094] [2025-01-10 06:25:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:53,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:25:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:53,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:25:53,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:25:53,512 INFO L87 Difference]: Start difference. First operand 1952 states and 2807 transitions. Second operand has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:53,871 INFO L93 Difference]: Finished difference Result 3861 states and 5568 transitions. [2025-01-10 06:25:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:25:53,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2025-01-10 06:25:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:53,878 INFO L225 Difference]: With dead ends: 3861 [2025-01-10 06:25:53,878 INFO L226 Difference]: Without dead ends: 1972 [2025-01-10 06:25:53,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:25:53,882 INFO L435 NwaCegarLoop]: 1325 mSDtfsCounter, 16 mSDsluCounter, 7648 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8973 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:53,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8973 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:25:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2025-01-10 06:25:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1966. [2025-01-10 06:25:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1932 states have (on average 1.4368530020703933) internal successors, (2776), 1942 states have internal predecessors, (2776), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 06:25:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2825 transitions. [2025-01-10 06:25:53,924 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2825 transitions. Word has length 193 [2025-01-10 06:25:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:53,924 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 2825 transitions. [2025-01-10 06:25:53,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2825 transitions. [2025-01-10 06:25:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:25:53,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:53,927 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:53,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:25:53,927 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:53,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1800352909, now seen corresponding path program 1 times [2025-01-10 06:25:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:53,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964941276] [2025-01-10 06:25:53,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:53,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:25:54,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:25:54,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:54,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:25:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964941276] [2025-01-10 06:25:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964941276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:25:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199354320] [2025-01-10 06:25:54,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:54,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:54,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:54,697 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:25:54,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:25:55,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:25:55,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:25:55,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:55,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:55,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 06:25:55,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:25:55,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:25:55,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199354320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:55,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:25:55,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-01-10 06:25:55,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282587627] [2025-01-10 06:25:55,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:55,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:25:55,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:55,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:25:55,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:25:55,533 INFO L87 Difference]: Start difference. First operand 1966 states and 2825 transitions. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:56,062 INFO L93 Difference]: Finished difference Result 3882 states and 5595 transitions. [2025-01-10 06:25:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:25:56,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2025-01-10 06:25:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:56,069 INFO L225 Difference]: With dead ends: 3882 [2025-01-10 06:25:56,069 INFO L226 Difference]: Without dead ends: 1986 [2025-01-10 06:25:56,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:25:56,073 INFO L435 NwaCegarLoop]: 1332 mSDtfsCounter, 31 mSDsluCounter, 7611 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8943 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:56,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8943 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:25:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2025-01-10 06:25:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1976. [2025-01-10 06:25:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1942 states have (on average 1.435633367662204) internal successors, (2788), 1952 states have internal predecessors, (2788), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 06:25:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2837 transitions. [2025-01-10 06:25:56,112 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2837 transitions. Word has length 193 [2025-01-10 06:25:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:56,112 INFO L471 AbstractCegarLoop]: Abstraction has 1976 states and 2837 transitions. [2025-01-10 06:25:56,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2837 transitions. [2025-01-10 06:25:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-10 06:25:56,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:56,115 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:56,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:25:56,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:56,319 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:56,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1774621056, now seen corresponding path program 1 times [2025-01-10 06:25:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:56,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245495556] [2025-01-10 06:25:56,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:56,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-10 06:25:56,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-10 06:25:56,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:56,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:25:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:56,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245495556] [2025-01-10 06:25:56,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245495556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:56,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:56,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:25:56,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943883808] [2025-01-10 06:25:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:56,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:25:56,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:56,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:25:56,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:25:56,889 INFO L87 Difference]: Start difference. First operand 1976 states and 2837 transitions. Second operand has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:57,422 INFO L93 Difference]: Finished difference Result 3900 states and 5619 transitions. [2025-01-10 06:25:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:25:57,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 194 [2025-01-10 06:25:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:57,429 INFO L225 Difference]: With dead ends: 3900 [2025-01-10 06:25:57,429 INFO L226 Difference]: Without dead ends: 1994 [2025-01-10 06:25:57,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:25:57,433 INFO L435 NwaCegarLoop]: 1332 mSDtfsCounter, 19 mSDsluCounter, 10156 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11488 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:57,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 11488 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:25:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2025-01-10 06:25:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1982. [2025-01-10 06:25:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1948 states have (on average 1.4342915811088295) internal successors, (2794), 1958 states have internal predecessors, (2794), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 06:25:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2843 transitions. [2025-01-10 06:25:57,479 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2843 transitions. Word has length 194 [2025-01-10 06:25:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:57,479 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2843 transitions. [2025-01-10 06:25:57,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:25:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2843 transitions. [2025-01-10 06:25:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-10 06:25:57,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:57,481 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:57,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:25:57,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:57,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 139288164, now seen corresponding path program 1 times [2025-01-10 06:25:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889986922] [2025-01-10 06:25:57,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:57,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-10 06:25:57,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-10 06:25:57,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:57,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:25:58,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:58,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889986922] [2025-01-10 06:25:58,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889986922] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:25:58,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087764959] [2025-01-10 06:25:58,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:58,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:58,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:58,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:25:58,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:25:58,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-10 06:25:58,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-10 06:25:58,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:58,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:58,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:25:58,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:25:59,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:25:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087764959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:59,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:25:59,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-10 06:25:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840830376] [2025-01-10 06:25:59,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:59,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:59,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:59,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:25:59,006 INFO L87 Difference]: Start difference. First operand 1982 states and 2843 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:25:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:59,058 INFO L93 Difference]: Finished difference Result 3854 states and 5558 transitions. [2025-01-10 06:25:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:25:59,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 194 [2025-01-10 06:25:59,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:59,072 INFO L225 Difference]: With dead ends: 3854 [2025-01-10 06:25:59,072 INFO L226 Difference]: Without dead ends: 1985 [2025-01-10 06:25:59,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:25:59,077 INFO L435 NwaCegarLoop]: 1341 mSDtfsCounter, 0 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4016 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:59,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4016 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:25:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2025-01-10 06:25:59,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1985. [2025-01-10 06:25:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1950 states have (on average 1.4343589743589744) internal successors, (2797), 1961 states have internal predecessors, (2797), 25 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (28), 21 states have call predecessors, (28), 24 states have call successors, (28) [2025-01-10 06:25:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2850 transitions. [2025-01-10 06:25:59,122 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2850 transitions. Word has length 194 [2025-01-10 06:25:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:59,123 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2850 transitions. [2025-01-10 06:25:59,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:25:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2850 transitions. [2025-01-10 06:25:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-10 06:25:59,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:59,126 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:59,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:25:59,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 06:25:59,328 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:59,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash 940176292, now seen corresponding path program 1 times [2025-01-10 06:25:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151295835] [2025-01-10 06:25:59,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:59,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-10 06:26:00,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-10 06:26:00,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:26:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:26:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:26:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:26:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151295835] [2025-01-10 06:26:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151295835] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:26:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904986906] [2025-01-10 06:26:00,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:26:00,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:26:00,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:26:00,812 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:26:00,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:26:01,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-10 06:26:02,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-10 06:26:02,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:26:02,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:26:02,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 06:26:02,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:26:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 06:26:02,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:26:02,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904986906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:26:02,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:26:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-10 06:26:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631492958] [2025-01-10 06:26:02,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:26:02,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:26:02,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:26:02,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:26:02,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:26:02,468 INFO L87 Difference]: Start difference. First operand 1985 states and 2850 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:26:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:26:02,798 INFO L93 Difference]: Finished difference Result 3772 states and 5454 transitions. [2025-01-10 06:26:02,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:26:02,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 198 [2025-01-10 06:26:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:26:02,806 INFO L225 Difference]: With dead ends: 3772 [2025-01-10 06:26:02,806 INFO L226 Difference]: Without dead ends: 1995 [2025-01-10 06:26:02,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:26:02,811 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 12 mSDsluCounter, 6333 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7664 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:26:02,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7664 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:26:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-01-10 06:26:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2025-01-10 06:26:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1958 states have (on average 1.4325842696629214) internal successors, (2805), 1969 states have internal predecessors, (2805), 25 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (28), 21 states have call predecessors, (28), 24 states have call successors, (28) [2025-01-10 06:26:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2858 transitions. [2025-01-10 06:26:02,850 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2858 transitions. Word has length 198 [2025-01-10 06:26:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:26:02,851 INFO L471 AbstractCegarLoop]: Abstraction has 1993 states and 2858 transitions. [2025-01-10 06:26:02,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:26:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2858 transitions. [2025-01-10 06:26:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-10 06:26:02,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:26:02,853 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:02,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:26:03,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:26:03,055 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:26:03,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:26:03,055 INFO L85 PathProgramCache]: Analyzing trace with hash 721250526, now seen corresponding path program 1 times [2025-01-10 06:26:03,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:26:03,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781311086] [2025-01-10 06:26:03,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:26:03,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:26:03,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-10 06:26:03,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-10 06:26:03,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:26:03,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:26:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:26:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:26:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781311086] [2025-01-10 06:26:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781311086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:26:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:26:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:26:03,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196675950] [2025-01-10 06:26:03,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:26:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:26:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:26:03,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:26:03,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:26:03,515 INFO L87 Difference]: Start difference. First operand 1993 states and 2858 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:26:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:26:03,873 INFO L93 Difference]: Finished difference Result 3774 states and 5450 transitions. [2025-01-10 06:26:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:26:03,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 199 [2025-01-10 06:26:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:26:03,881 INFO L225 Difference]: With dead ends: 3774 [2025-01-10 06:26:03,881 INFO L226 Difference]: Without dead ends: 2003 [2025-01-10 06:26:03,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:26:03,885 INFO L435 NwaCegarLoop]: 1324 mSDtfsCounter, 14 mSDsluCounter, 6301 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 7625 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:26:03,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 7625 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:26:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2025-01-10 06:26:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2001. [2025-01-10 06:26:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2001 states, 1966 states have (on average 1.4318413021363174) internal successors, (2815), 1977 states have internal predecessors, (2815), 25 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (28), 21 states have call predecessors, (28), 24 states have call successors, (28) [2025-01-10 06:26:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2868 transitions. [2025-01-10 06:26:03,940 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2868 transitions. Word has length 199 [2025-01-10 06:26:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:26:03,941 INFO L471 AbstractCegarLoop]: Abstraction has 2001 states and 2868 transitions. [2025-01-10 06:26:03,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:26:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2868 transitions. [2025-01-10 06:26:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-10 06:26:03,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:26:03,944 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:03,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:26:03,945 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:26:03,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:26:03,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1965655984, now seen corresponding path program 1 times [2025-01-10 06:26:03,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:26:03,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309090579] [2025-01-10 06:26:03,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:26:03,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:26:04,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-10 06:26:04,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-10 06:26:04,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:26:04,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:26:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:26:04,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:26:04,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309090579] [2025-01-10 06:26:04,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309090579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:26:04,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:26:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:26:04,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500149346] [2025-01-10 06:26:04,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:26:04,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:26:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:26:04,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:26:04,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:26:04,624 INFO L87 Difference]: Start difference. First operand 2001 states and 2868 transitions. Second operand has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:26:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:26:05,066 INFO L93 Difference]: Finished difference Result 3803 states and 5489 transitions. [2025-01-10 06:26:05,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:26:05,067 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 200 [2025-01-10 06:26:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:26:05,074 INFO L225 Difference]: With dead ends: 3803 [2025-01-10 06:26:05,074 INFO L226 Difference]: Without dead ends: 2023 [2025-01-10 06:26:05,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:26:05,079 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 31 mSDsluCounter, 8904 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10237 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:26:05,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10237 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:26:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2025-01-10 06:26:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2017. [2025-01-10 06:26:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1982 states have (on average 1.4303733602421795) internal successors, (2835), 1993 states have internal predecessors, (2835), 25 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (28), 21 states have call predecessors, (28), 24 states have call successors, (28) [2025-01-10 06:26:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2888 transitions. [2025-01-10 06:26:05,115 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2888 transitions. Word has length 200 [2025-01-10 06:26:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:26:05,116 INFO L471 AbstractCegarLoop]: Abstraction has 2017 states and 2888 transitions. [2025-01-10 06:26:05,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:26:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2888 transitions. [2025-01-10 06:26:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-10 06:26:05,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:26:05,118 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:05,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:26:05,119 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:26:05,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:26:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1047913751, now seen corresponding path program 1 times [2025-01-10 06:26:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:26:05,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589328725] [2025-01-10 06:26:05,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:26:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:26:05,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-10 06:26:05,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-10 06:26:05,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:26:05,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:26:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:26:05,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:26:05,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589328725] [2025-01-10 06:26:05,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589328725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:26:05,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:26:05,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:26:05,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687289402] [2025-01-10 06:26:05,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:26:05,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:26:05,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:26:05,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:26:05,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:26:05,527 INFO L87 Difference]: Start difference. First operand 2017 states and 2888 transitions. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:26:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:26:05,746 INFO L93 Difference]: Finished difference Result 3813 states and 5500 transitions. [2025-01-10 06:26:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:26:05,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 200 [2025-01-10 06:26:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:26:05,752 INFO L225 Difference]: With dead ends: 3813 [2025-01-10 06:26:05,752 INFO L226 Difference]: Without dead ends: 2023 [2025-01-10 06:26:05,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:26:05,757 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 8 mSDsluCounter, 3802 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5137 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:26:05,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5137 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:26:05,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2025-01-10 06:26:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2023. [2025-01-10 06:26:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2023 states, 1988 states have (on average 1.4290744466800804) internal successors, (2841), 1999 states have internal predecessors, (2841), 25 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (28), 21 states have call predecessors, (28), 24 states have call successors, (28) [2025-01-10 06:26:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2894 transitions. [2025-01-10 06:26:05,790 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2894 transitions. Word has length 200 [2025-01-10 06:26:05,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:26:05,791 INFO L471 AbstractCegarLoop]: Abstraction has 2023 states and 2894 transitions. [2025-01-10 06:26:05,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:26:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2894 transitions. [2025-01-10 06:26:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-10 06:26:05,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:26:05,793 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:05,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:26:05,793 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:26:05,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:26:05,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2037025407, now seen corresponding path program 1 times [2025-01-10 06:26:05,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:26:05,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327260746] [2025-01-10 06:26:05,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:26:05,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:26:05,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-10 06:26:06,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-10 06:26:06,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:26:06,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:26:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:26:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:26:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327260746] [2025-01-10 06:26:06,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327260746] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:26:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069443058] [2025-01-10 06:26:06,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:26:06,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:26:06,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:26:06,740 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:26:06,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:26:07,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-10 06:26:07,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-10 06:26:07,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:26:07,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:26:07,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 156 conjuncts are in the unsatisfiable core [2025-01-10 06:26:07,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:26:07,787 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:26:07,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 06:26:07,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:26:07,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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:26:08,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 20 [2025-01-10 06:26:08,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:26:08,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2025-01-10 06:26:08,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:26:08,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-01-10 06:26:08,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 06:26:08,259 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-01-10 06:26:08,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-01-10 06:26:08,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-10 06:26:08,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 06:26:08,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2025-01-10 06:26:08,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 06:26:08,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 06:26:08,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 73 [2025-01-10 06:26:08,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 06:26:08,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18