./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7249a4084734468a9df38189de6441ee3548af581a8047a10bfcd263bdf18bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:40:32,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:40:32,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:40:32,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:40:32,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:40:32,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:40:32,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:40:32,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:40:32,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:40:32,516 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:40:32,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:40:32,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:40:32,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:40:32,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:40:32,517 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:40:32,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:40:32,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:40:32,519 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:40:32,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:40:32,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:40:32,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:40:32,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:40:32,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:40:32,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:40:32,521 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:40:32,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:40:32,521 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:40:32,521 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:40:32,521 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:40:32,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:40:32,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:40:32,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:40:32,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:40:32,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:40:32,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:40:32,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:40:32,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:40:32,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:40:32,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:40:32,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:40:32,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:40:32,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:40:32,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:40:32,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:40:32,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:40:32,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:40:32,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:40:32,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:40:32,524 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 ! call(reach_error())) ) 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 -> d7249a4084734468a9df38189de6441ee3548af581a8047a10bfcd263bdf18bd [2025-01-09 15:40:32,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:40:32,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:40:32,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:40:32,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:40:32,829 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:40:32,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i [2025-01-09 15:40:34,161 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c9eec290/9146233768e74bbb952710d23747bca5/FLAG9688709fa [2025-01-09 15:40:34,451 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:40:34,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i [2025-01-09 15:40:34,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c9eec290/9146233768e74bbb952710d23747bca5/FLAG9688709fa [2025-01-09 15:40:34,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c9eec290/9146233768e74bbb952710d23747bca5 [2025-01-09 15:40:34,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:40:34,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:40:34,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:40:34,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:40:34,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:40:34,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:40:34" (1/1) ... [2025-01-09 15:40:34,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660a1e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:34, skipping insertion in model container [2025-01-09 15:40:34,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:40:34" (1/1) ... [2025-01-09 15:40:34,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:40:34,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i[917,930] [2025-01-09 15:40:34,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:40:35,008 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:40:35,019 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i[917,930] [2025-01-09 15:40:35,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:40:35,090 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:40:35,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35 WrapperNode [2025-01-09 15:40:35,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:40:35,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:40:35,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:40:35,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:40:35,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,160 INFO L138 Inliner]: procedures = 26, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-01-09 15:40:35,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:40:35,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:40:35,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:40:35,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:40:35,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,190 INFO L175 MemorySlicer]: Split 130 memory accesses to 5 slices as follows [2, 34, 4, 55, 35]. 42 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 1, 6, 3]. The 19 writes are split as follows [0, 6, 1, 6, 6]. [2025-01-09 15:40:35,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:40:35,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:40:35,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:40:35,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:40:35,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (1/1) ... [2025-01-09 15:40:35,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:40:35,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:40:35,262 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-09 15:40:35,265 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-09 15:40:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:40:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:40:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:40:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:40:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:40:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:40:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:40:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:40:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:40:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:40:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:40:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:40:35,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:40:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:40:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:40:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:40:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:40:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:40:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:40:35,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:40:35,418 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:40:35,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:40:35,884 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-01-09 15:40:35,884 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:40:35,897 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:40:35,899 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:40:35,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:40:35 BoogieIcfgContainer [2025-01-09 15:40:35,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:40:35,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:40:35,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:40:35,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:40:35,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:40:34" (1/3) ... [2025-01-09 15:40:35,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a054c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:40:35, skipping insertion in model container [2025-01-09 15:40:35,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:35" (2/3) ... [2025-01-09 15:40:35,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a054c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:40:35, skipping insertion in model container [2025-01-09 15:40:35,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:40:35" (3/3) ... [2025-01-09 15:40:35,910 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-90.i [2025-01-09 15:40:35,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:40:35,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-90.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:40:35,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:40:36,001 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;@43a267be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:40:36,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:40:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 88 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:40:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:40:36,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:40:36,022 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 15:40:36,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:40:36,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:40:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash -307412669, now seen corresponding path program 1 times [2025-01-09 15:40:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:40:36,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205657982] [2025-01-09 15:40:36,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:40:36,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:40:36,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:40:36,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:40:36,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:40:36,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:40:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 15:40:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:40:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205657982] [2025-01-09 15:40:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205657982] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:40:36,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908395063] [2025-01-09 15:40:36,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:40:36,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:40:36,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:40:36,364 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-09 15:40:36,365 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-09 15:40:36,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:40:36,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:40:36,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:40:36,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:40:36,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:40:36,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:40:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 15:40:36,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:40:36,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908395063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:40:36,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:40:36,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:40:36,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959010010] [2025-01-09 15:40:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:40:36,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:40:36,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:40:36,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:40:36,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:40:36,725 INFO L87 Difference]: Start difference. First operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 88 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:40:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:40:36,749 INFO L93 Difference]: Finished difference Result 214 states and 333 transitions. [2025-01-09 15:40:36,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:40:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2025-01-09 15:40:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:40:36,756 INFO L225 Difference]: With dead ends: 214 [2025-01-09 15:40:36,756 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 15:40:36,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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-09 15:40:36,761 INFO L435 NwaCegarLoop]: 154 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, 154 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-09 15:40:36,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:40:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 15:40:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 15:40:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:40:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2025-01-09 15:40:36,804 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 153 [2025-01-09 15:40:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:40:36,804 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2025-01-09 15:40:36,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:40:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2025-01-09 15:40:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:40:36,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:40:36,807 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 15:40:36,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:40:37,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:40:37,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:40:37,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:40:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash 577661211, now seen corresponding path program 1 times [2025-01-09 15:40:37,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:40:37,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976816050] [2025-01-09 15:40:37,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:40:37,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:40:37,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:40:37,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:40:37,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:40:37,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:40:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 15:40:37,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:40:37,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976816050] [2025-01-09 15:40:37,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976816050] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:40:37,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26051229] [2025-01-09 15:40:37,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:40:37,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:40:37,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:40:37,527 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-09 15:40:37,530 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-09 15:40:37,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:40:37,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:40:37,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:40:37,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:40:37,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:40:37,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:40:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:40:37,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:40:37,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26051229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:40:37,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:40:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 15:40:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606675833] [2025-01-09 15:40:37,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:40:37,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:40:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:40:37,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:40:37,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:40:37,839 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:40:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:40:37,878 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2025-01-09 15:40:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:40:37,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-01-09 15:40:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:40:37,880 INFO L225 Difference]: With dead ends: 213 [2025-01-09 15:40:37,880 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:40:37,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:40:37,882 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:40:37,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:40:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:40:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 15:40:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:40:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-01-09 15:40:37,896 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2025-01-09 15:40:37,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:40:37,898 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-01-09 15:40:37,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:40:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-01-09 15:40:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:40:37,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:40:37,904 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 15:40:37,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:40:38,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:40:38,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:40:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:40:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash 851507638, now seen corresponding path program 1 times [2025-01-09 15:40:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:40:38,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074427038] [2025-01-09 15:40:38,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:40:38,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:40:38,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:40:38,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:40:38,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:40:38,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:40:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:40:38,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:40:38,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074427038] [2025-01-09 15:40:38,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074427038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:40:38,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:40:38,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:40:38,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975395371] [2025-01-09 15:40:38,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:40:38,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:40:38,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:40:38,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:40:38,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:40:38,614 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:40:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:40:38,723 INFO L93 Difference]: Finished difference Result 263 states and 376 transitions. [2025-01-09 15:40:38,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:40:38,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2025-01-09 15:40:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:40:38,725 INFO L225 Difference]: With dead ends: 263 [2025-01-09 15:40:38,725 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 15:40:38,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:40:38,727 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 60 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:40:38,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 716 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:40:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 15:40:38,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 114. [2025-01-09 15:40:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:40:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2025-01-09 15:40:38,743 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 155 [2025-01-09 15:40:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:40:38,743 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2025-01-09 15:40:38,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:40:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2025-01-09 15:40:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:40:38,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:40:38,746 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 15:40:38,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:40:38,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:40:38,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:40:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1070362356, now seen corresponding path program 1 times [2025-01-09 15:40:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:40:38,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591726636] [2025-01-09 15:40:38,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:40:38,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:40:38,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:40:38,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:40:38,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:40:38,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:40:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:40:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:40:39,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591726636] [2025-01-09 15:40:39,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591726636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:40:39,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:40:39,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:40:39,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179226458] [2025-01-09 15:40:39,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:40:39,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:40:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:40:39,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:40:39,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:40:39,385 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:40:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:40:39,531 INFO L93 Difference]: Finished difference Result 262 states and 372 transitions. [2025-01-09 15:40:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:40:39,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2025-01-09 15:40:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:40:39,533 INFO L225 Difference]: With dead ends: 262 [2025-01-09 15:40:39,533 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 15:40:39,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:40:39,535 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 162 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:40:39,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 533 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:40:39,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 15:40:39,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2025-01-09 15:40:39,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:40:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2025-01-09 15:40:39,542 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 155 [2025-01-09 15:40:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:40:39,545 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2025-01-09 15:40:39,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:40:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2025-01-09 15:40:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 15:40:39,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:40:39,550 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 15:40:39,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:40:39,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:40:39,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:40:39,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1738847777, now seen corresponding path program 1 times [2025-01-09 15:40:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:40:39,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541943948] [2025-01-09 15:40:39,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:40:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:40:39,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 15:40:39,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 15:40:39,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:40:39,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:40:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:40:40,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:40:40,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541943948] [2025-01-09 15:40:40,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541943948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:40:40,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:40:40,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:40:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905474995] [2025-01-09 15:40:40,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:40:40,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:40:40,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:40:40,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:40:40,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:40:40,319 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:40:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:40:40,844 INFO L93 Difference]: Finished difference Result 313 states and 444 transitions. [2025-01-09 15:40:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:40:40,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 156 [2025-01-09 15:40:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:40:40,846 INFO L225 Difference]: With dead ends: 313 [2025-01-09 15:40:40,847 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 15:40:40,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:40:40,848 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 370 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:40:40,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 756 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:40:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 15:40:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 137. [2025-01-09 15:40:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 115 states have internal predecessors, (154), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:40:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2025-01-09 15:40:40,869 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 156 [2025-01-09 15:40:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:40:40,870 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2025-01-09 15:40:40,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:40:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2025-01-09 15:40:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 15:40:40,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:40:40,872 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 15:40:40,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:40:40,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:40:40,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:40:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1152041763, now seen corresponding path program 1 times [2025-01-09 15:40:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:40:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573756891] [2025-01-09 15:40:40,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:40:40,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:40:40,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 15:40:40,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 15:40:40,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:40:40,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:40:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:40:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:40:42,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573756891] [2025-01-09 15:40:42,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573756891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:40:42,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:40:42,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:40:42,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395430683] [2025-01-09 15:40:42,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:40:42,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:40:42,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:40:42,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:40:42,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:40:42,085 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:40:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:40:42,430 INFO L93 Difference]: Finished difference Result 278 states and 392 transitions. [2025-01-09 15:40:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:40:42,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-01-09 15:40:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:40:42,433 INFO L225 Difference]: With dead ends: 278 [2025-01-09 15:40:42,433 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 15:40:42,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:40:42,434 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 189 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:40:42,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 691 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:40:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 15:40:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-01-09 15:40:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.322314049586777) internal successors, (160), 121 states have internal predecessors, (160), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:40:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 200 transitions. [2025-01-09 15:40:42,463 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 200 transitions. Word has length 156 [2025-01-09 15:40:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:40:42,464 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 200 transitions. [2025-01-09 15:40:42,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:40:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 200 transitions. [2025-01-09 15:40:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 15:40:42,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:40:42,467 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 15:40:42,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:40:42,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:40:42,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:40:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1321983505, now seen corresponding path program 1 times [2025-01-09 15:40:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:40:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716695131] [2025-01-09 15:40:42,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:40:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:40:42,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 15:40:42,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 15:40:42,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:40:42,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:40:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-01-09 15:40:44,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:40:44,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716695131] [2025-01-09 15:40:44,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716695131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:40:44,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071604445] [2025-01-09 15:40:44,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:40:44,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:40:44,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:40:44,195 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-09 15:40:44,198 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-09 15:40:44,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 15:40:44,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 15:40:44,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:40:44,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:40:44,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-09 15:40:44,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:40:44,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 5 [2025-01-09 15:40:48,787 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 57 treesize of output 43 [2025-01-09 15:40:48,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:40:48,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2025-01-09 15:40:48,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:40:48,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:40:48,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-01-09 15:40:49,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:40:49,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:40:49,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:40:49,337 INFO L349 Elim1Store]: treesize reduction 112, result has 17.0 percent of original size [2025-01-09 15:40:49,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 152 treesize of output 124 [2025-01-09 15:40:51,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:40:51,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 341 treesize of output 933 [2025-01-09 15:41:15,859 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.