./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.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-sp_file-63.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 d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:13:02,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:13:02,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:13:02,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:13:02,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:13:02,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:13:02,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:13:02,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:13:02,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:13:02,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:13:02,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:13:02,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:13:02,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:13:02,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:13:02,775 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:13:02,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:13:02,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:13:02,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:13:02,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:13:02,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:13:02,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:13:02,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:13:02,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:13:02,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:13:02,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:13:02,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:13:02,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:13:02,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:13:02,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:13:02,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:13:02,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:13:02,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:13:02,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:13:02,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:13:02,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:13:02,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:13:02,779 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 -> d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e [2025-01-09 16:13:03,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:13:03,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:13:03,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:13:03,048 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:13:03,049 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:13:03,051 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-sp_file-63.i [2025-01-09 16:13:04,268 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/581cd3be7/cf1053f85f834a128fe00805e1a893ba/FLAG9957a48d3 [2025-01-09 16:13:04,584 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:13:04,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2025-01-09 16:13:04,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/581cd3be7/cf1053f85f834a128fe00805e1a893ba/FLAG9957a48d3 [2025-01-09 16:13:04,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/581cd3be7/cf1053f85f834a128fe00805e1a893ba [2025-01-09 16:13:04,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:13:04,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:13:04,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:13:04,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:13:04,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:13:04,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:13:04" (1/1) ... [2025-01-09 16:13:04,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:04, skipping insertion in model container [2025-01-09 16:13:04,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:13:04" (1/1) ... [2025-01-09 16:13:04,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:13:05,030 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-sp_file-63.i[917,930] [2025-01-09 16:13:05,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:13:05,131 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:13:05,141 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-sp_file-63.i[917,930] [2025-01-09 16:13:05,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:13:05,218 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:13:05,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05 WrapperNode [2025-01-09 16:13:05,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:13:05,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:13:05,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:13:05,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:13:05,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,284 INFO L138 Inliner]: procedures = 30, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 676 [2025-01-09 16:13:05,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:13:05,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:13:05,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:13:05,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:13:05,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,320 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:13:05,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:13:05,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:13:05,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:13:05,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:13:05,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (1/1) ... [2025-01-09 16:13:05,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:13:05,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:13:05,383 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 16:13:05,389 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 16:13:05,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:13:05,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:13:05,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:13:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:13:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:13:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:13:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:13:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:13:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:13:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:13:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:13:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:13:05,518 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:13:05,519 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:13:06,210 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2025-01-09 16:13:06,210 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:13:06,223 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:13:06,223 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:13:06,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:13:06 BoogieIcfgContainer [2025-01-09 16:13:06,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:13:06,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:13:06,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:13:06,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:13:06,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:13:04" (1/3) ... [2025-01-09 16:13:06,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2509d9b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:13:06, skipping insertion in model container [2025-01-09 16:13:06,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:13:05" (2/3) ... [2025-01-09 16:13:06,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2509d9b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:13:06, skipping insertion in model container [2025-01-09 16:13:06,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:13:06" (3/3) ... [2025-01-09 16:13:06,232 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2025-01-09 16:13:06,245 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:13:06,247 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-63.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:13:06,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:13:06,313 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;@52a6b15a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:13:06,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:13:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:13:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 16:13:06,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:13:06,331 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:06,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:13:06,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:13:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash -53865419, now seen corresponding path program 1 times [2025-01-09 16:13:06,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:13:06,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409579384] [2025-01-09 16:13:06,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:13:06,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 16:13:06,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 16:13:06,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:06,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 16:13:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:13:06,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409579384] [2025-01-09 16:13:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409579384] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:13:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622351783] [2025-01-09 16:13:06,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:13:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:13:06,761 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 16:13:06,763 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 16:13:06,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 16:13:07,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 16:13:07,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:07,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:07,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:13:07,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:13:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 16:13:07,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:13:07,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622351783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:13:07,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:13:07,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:13:07,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777124677] [2025-01-09 16:13:07,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:13:07,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:13:07,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:13:07,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:13:07,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:13:07,120 INFO L87 Difference]: Start difference. First operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:13:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:13:07,142 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2025-01-09 16:13:07,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:13:07,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-01-09 16:13:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:13:07,150 INFO L225 Difference]: With dead ends: 270 [2025-01-09 16:13:07,150 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 16:13:07,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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 16:13:07,154 INFO L435 NwaCegarLoop]: 198 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, 198 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 16:13:07,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:13:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 16:13:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-01-09 16:13:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:13:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-01-09 16:13:07,194 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2025-01-09 16:13:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:13:07,194 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-01-09 16:13:07,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:13:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-01-09 16:13:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 16:13:07,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:13:07,200 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:07,210 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-09 16:13:07,401 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 16:13:07,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:13:07,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:13:07,402 INFO L85 PathProgramCache]: Analyzing trace with hash 375907785, now seen corresponding path program 1 times [2025-01-09 16:13:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:13:07,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820591813] [2025-01-09 16:13:07,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:13:07,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 16:13:07,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 16:13:07,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:07,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 16:13:07,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:13:07,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820591813] [2025-01-09 16:13:07,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820591813] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:13:07,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725269977] [2025-01-09 16:13:07,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:07,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:13:07,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:13:08,001 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 16:13:08,004 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 16:13:08,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 16:13:08,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 16:13:08,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:08,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:08,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:13:08,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:13:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:13:08,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:13:08,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725269977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:13:08,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:13:08,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 16:13:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594460116] [2025-01-09 16:13:08,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:13:08,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:13:08,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:13:08,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:13:08,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:13:08,377 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:13:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:13:08,435 INFO L93 Difference]: Finished difference Result 270 states and 397 transitions. [2025-01-09 16:13:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:13:08,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-01-09 16:13:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:13:08,438 INFO L225 Difference]: With dead ends: 270 [2025-01-09 16:13:08,438 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 16:13:08,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:13:08,440 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:13:08,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:13:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 16:13:08,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-01-09 16:13:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:13:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-01-09 16:13:08,451 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2025-01-09 16:13:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:13:08,453 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-01-09 16:13:08,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:13:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-01-09 16:13:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 16:13:08,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:13:08,455 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:08,462 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-09 16:13:08,655 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 16:13:08,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:13:08,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:13:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1055966155, now seen corresponding path program 1 times [2025-01-09 16:13:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:13:08,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881277676] [2025-01-09 16:13:08,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:08,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:13:08,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 16:13:08,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 16:13:08,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:08,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 16:13:09,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:13:09,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881277676] [2025-01-09 16:13:09,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881277676] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:13:09,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005447529] [2025-01-09 16:13:09,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:09,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:13:09,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:13:09,020 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 16:13:09,023 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 16:13:09,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 16:13:09,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 16:13:09,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:09,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:09,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:13:09,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:13:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:13:09,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:13:09,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005447529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:13:09,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:13:09,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 16:13:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205248217] [2025-01-09 16:13:09,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:13:09,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:13:09,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:13:09,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:13:09,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:13:09,360 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:13:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:13:09,393 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2025-01-09 16:13:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:13:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-01-09 16:13:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:13:09,396 INFO L225 Difference]: With dead ends: 274 [2025-01-09 16:13:09,396 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 16:13:09,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:13:09,398 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:13:09,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:13:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 16:13:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-01-09 16:13:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:13:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-01-09 16:13:09,417 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2025-01-09 16:13:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:13:09,418 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-01-09 16:13:09,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:13:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-01-09 16:13:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 16:13:09,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:13:09,424 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:09,434 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-09 16:13:09,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:13:09,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:13:09,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:13:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1057813197, now seen corresponding path program 1 times [2025-01-09 16:13:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:13:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936733581] [2025-01-09 16:13:09,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:13:09,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 16:13:09,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 16:13:09,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:09,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 16:13:09,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:13:09,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936733581] [2025-01-09 16:13:09,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936733581] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:13:09,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632477184] [2025-01-09 16:13:09,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:09,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:13:09,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:13:09,901 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-09 16:13:09,904 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-09 16:13:10,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 16:13:10,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 16:13:10,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:10,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:10,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:13:10,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:13:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:13:10,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:13:10,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632477184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:13:10,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:13:10,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 16:13:10,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701010154] [2025-01-09 16:13:10,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:13:10,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:13:10,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:13:10,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:13:10,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:13:10,280 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:13:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:13:10,313 INFO L93 Difference]: Finished difference Result 277 states and 404 transitions. [2025-01-09 16:13:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:13:10,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-01-09 16:13:10,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:13:10,317 INFO L225 Difference]: With dead ends: 277 [2025-01-09 16:13:10,317 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 16:13:10,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 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 16:13:10,318 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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 16:13:10,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:13:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 16:13:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-01-09 16:13:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:13:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-01-09 16:13:10,337 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 156 [2025-01-09 16:13:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:13:10,337 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-01-09 16:13:10,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:13:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-01-09 16:13:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 16:13:10,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:13:10,339 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:10,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:13:10,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:13:10,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:13:10,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:13:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1796491432, now seen corresponding path program 1 times [2025-01-09 16:13:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:13:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666586823] [2025-01-09 16:13:10,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:13:10,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 16:13:10,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 16:13:10,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:10,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 16:13:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:13:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666586823] [2025-01-09 16:13:14,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666586823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:13:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431177622] [2025-01-09 16:13:14,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:14,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:13:14,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:13:14,141 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-09 16:13:14,145 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-09 16:13:14,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 16:13:14,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 16:13:14,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:14,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:14,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-09 16:13:14,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:13:15,935 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 15 treesize of output 1 [2025-01-09 16:13:16,681 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 25 treesize of output 13 [2025-01-09 16:13:17,073 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 25 treesize of output 13 [2025-01-09 16:13:17,546 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 25 treesize of output 13 [2025-01-09 16:13:17,962 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 25 treesize of output 13 [2025-01-09 16:13:18,358 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 25 treesize of output 13 [2025-01-09 16:13:18,760 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 25 treesize of output 13 [2025-01-09 16:13:19,133 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 25 treesize of output 13 [2025-01-09 16:13:19,618 INFO L349 Elim1Store]: treesize reduction 264, result has 11.7 percent of original size [2025-01-09 16:13:19,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 227 [2025-01-09 16:13:19,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 54 treesize of output 44 [2025-01-09 16:13:19,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 54 treesize of output 44 [2025-01-09 16:13:19,972 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-01-09 16:13:19,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 60 [2025-01-09 16:13:20,029 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 46 treesize of output 35 [2025-01-09 16:13:20,057 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 46 treesize of output 35 [2025-01-09 16:13:20,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,689 INFO L349 Elim1Store]: treesize reduction 34, result has 40.4 percent of original size [2025-01-09 16:13:20,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 93 [2025-01-09 16:13:20,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,763 INFO L349 Elim1Store]: treesize reduction 32, result has 33.3 percent of original size [2025-01-09 16:13:20,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2025-01-09 16:13:20,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:20,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:21,016 INFO L349 Elim1Store]: treesize reduction 162, result has 34.4 percent of original size [2025-01-09 16:13:21,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 532 [2025-01-09 16:13:27,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:27,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:27,845 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:27,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:27,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:27,853 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:27,853 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:27,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:27,857 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:27,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 160 [2025-01-09 16:13:27,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:27,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:27,934 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:27,935 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:27,939 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:27,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 126 [2025-01-09 16:13:28,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,094 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,094 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,096 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2025-01-09 16:13:28,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,310 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,310 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,313 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2025-01-09 16:13:28,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,337 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,342 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,343 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,345 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 75 [2025-01-09 16:13:28,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,388 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,394 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,394 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,397 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 176 [2025-01-09 16:13:28,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,494 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,500 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,502 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 144 [2025-01-09 16:13:28,655 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,662 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,666 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,668 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 172 [2025-01-09 16:13:28,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:28,781 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:28,821 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2025-01-09 16:13:28,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 642 treesize of output 633 [2025-01-09 16:13:29,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,404 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,439 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2025-01-09 16:13:29,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 208 [2025-01-09 16:13:29,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,764 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,769 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,770 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2025-01-09 16:13:29,796 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,802 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,806 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,807 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 177 [2025-01-09 16:13:29,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:29,988 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,992 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,993 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:29,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2025-01-09 16:13:30,104 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:30,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:30,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:30,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:30,111 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:30,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:30,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:30,116 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:30,118 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:30,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2025-01-09 16:13:32,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,343 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,348 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,349 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2025-01-09 16:13:32,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,390 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,396 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 152 [2025-01-09 16:13:32,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,428 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,437 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2025-01-09 16:13:32,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,575 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,582 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,582 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2025-01-09 16:13:32,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,738 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2025-01-09 16:13:32,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 913 treesize of output 904 [2025-01-09 16:13:32,993 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:32,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:32,999 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,000 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 73 [2025-01-09 16:13:33,140 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,150 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,151 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 73 [2025-01-09 16:13:33,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,212 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 151 [2025-01-09 16:13:33,328 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,334 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2025-01-09 16:13:33,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,450 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,456 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2025-01-09 16:13:33,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,514 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,526 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,526 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 86 [2025-01-09 16:13:33,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,667 INFO L349 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2025-01-09 16:13:33,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 631 treesize of output 621 [2025-01-09 16:13:33,876 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:33,886 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:33,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2025-01-09 16:13:34,024 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:34,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:34,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:34,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:34,032 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:34,034 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:13:34,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 91 [2025-01-09 16:13:38,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:38,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:38,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:38,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:38,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:38,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:38,612 INFO L349 Elim1Store]: treesize reduction 105, result has 29.5 percent of original size [2025-01-09 16:13:38,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 112 [2025-01-09 16:13:43,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:43,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:43,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:43,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:43,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:43,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:43,926 INFO L349 Elim1Store]: treesize reduction 194, result has 11.4 percent of original size [2025-01-09 16:13:43,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 94 [2025-01-09 16:13:43,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,031 INFO L349 Elim1Store]: treesize reduction 98, result has 18.3 percent of original size [2025-01-09 16:13:44,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2025-01-09 16:13:44,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,060 INFO L349 Elim1Store]: treesize reduction 218, result has 0.5 percent of original size [2025-01-09 16:13:44,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 64 [2025-01-09 16:13:44,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,081 INFO L349 Elim1Store]: treesize reduction 218, result has 0.5 percent of original size [2025-01-09 16:13:44,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 64 [2025-01-09 16:13:44,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,103 INFO L349 Elim1Store]: treesize reduction 150, result has 0.7 percent of original size [2025-01-09 16:13:44,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 30 [2025-01-09 16:13:44,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:44,119 INFO L349 Elim1Store]: treesize reduction 93, result has 1.1 percent of original size [2025-01-09 16:13:44,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 30 [2025-01-09 16:13:45,773 INFO L349 Elim1Store]: treesize reduction 280, result has 0.4 percent of original size [2025-01-09 16:13:45,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 220 treesize of output 184 [2025-01-09 16:13:45,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,808 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2025-01-09 16:13:45,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 53 treesize of output 34 [2025-01-09 16:13:45,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 95 treesize of output 79 [2025-01-09 16:13:45,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 120 [2025-01-09 16:13:45,875 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 16:13:45,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 120 [2025-01-09 16:13:45,908 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 16:13:45,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 174 [2025-01-09 16:13:45,947 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 16:13:45,963 INFO L349 Elim1Store]: treesize reduction 380, result has 0.3 percent of original size [2025-01-09 16:13:45,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 292 treesize of output 234 [2025-01-09 16:13:45,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 137 treesize of output 121 [2025-01-09 16:13:45,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:45,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2025-01-09 16:13:46,028 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 16:13:46,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2025-01-09 16:13:46,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2025-01-09 16:13:46,107 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 16:13:46,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2025-01-09 16:13:46,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2025-01-09 16:13:46,201 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 16:13:46,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2025-01-09 16:13:46,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:46,271 INFO L349 Elim1Store]: treesize reduction 79, result has 1.3 percent of original size [2025-01-09 16:13:46,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 208 [2025-01-09 16:13:47,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:47,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:13:47,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 23 [2025-01-09 16:13:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 199 proven. 161 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-01-09 16:13:47,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:13:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431177622] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:13:48,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:13:48,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2025-01-09 16:13:48,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873553557] [2025-01-09 16:13:48,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:13:48,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 16:13:48,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:13:48,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 16:13:48,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:13:48,120 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 20 states, 18 states have (on average 7.611111111111111) internal successors, (137), 20 states have internal predecessors, (137), 8 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2025-01-09 16:13:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:13:50,616 INFO L93 Difference]: Finished difference Result 433 states and 616 transitions. [2025-01-09 16:13:50,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 16:13:50,617 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.611111111111111) internal successors, (137), 20 states have internal predecessors, (137), 8 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) Word has length 158 [2025-01-09 16:13:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:13:50,619 INFO L225 Difference]: With dead ends: 433 [2025-01-09 16:13:50,619 INFO L226 Difference]: Without dead ends: 295 [2025-01-09 16:13:50,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=359, Invalid=1363, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 16:13:50,621 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1420 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:13:50,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 790 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 16:13:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-09 16:13:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 243. [2025-01-09 16:13:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.3953488372093024) internal successors, (300), 216 states have internal predecessors, (300), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 16:13:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 346 transitions. [2025-01-09 16:13:50,654 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 346 transitions. Word has length 158 [2025-01-09 16:13:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:13:50,655 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 346 transitions. [2025-01-09 16:13:50,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.611111111111111) internal successors, (137), 20 states have internal predecessors, (137), 8 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2025-01-09 16:13:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 346 transitions. [2025-01-09 16:13:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 16:13:50,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:13:50,658 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:50,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:13:50,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:13:50,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:13:50,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:13:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash -197653274, now seen corresponding path program 1 times [2025-01-09 16:13:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:13:50,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9223150] [2025-01-09 16:13:50,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:50,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:13:50,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 16:13:50,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 16:13:50,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:50,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:13:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:13:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9223150] [2025-01-09 16:13:55,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9223150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:13:55,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:13:55,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:13:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103822121] [2025-01-09 16:13:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:13:55,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:13:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:13:55,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:13:55,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:13:55,078 INFO L87 Difference]: Start difference. First operand 243 states and 346 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 16:13:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:13:55,662 INFO L93 Difference]: Finished difference Result 629 states and 895 transitions. [2025-01-09 16:13:55,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:13:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 158 [2025-01-09 16:13:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:13:55,666 INFO L225 Difference]: With dead ends: 629 [2025-01-09 16:13:55,666 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 16:13:55,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:13:55,668 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 264 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:13:55,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 869 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:13:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 16:13:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 379. [2025-01-09 16:13:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 330 states have (on average 1.3848484848484848) internal successors, (457), 331 states have internal predecessors, (457), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:13:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 539 transitions. [2025-01-09 16:13:55,704 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 539 transitions. Word has length 158 [2025-01-09 16:13:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:13:55,704 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 539 transitions. [2025-01-09 16:13:55,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 16:13:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 539 transitions. [2025-01-09 16:13:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 16:13:55,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:13:55,706 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:55,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:13:55,706 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:13:55,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:13:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash -567531199, now seen corresponding path program 1 times [2025-01-09 16:13:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:13:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416855494] [2025-01-09 16:13:55,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:13:55,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 16:13:55,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 16:13:55,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:55,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:13:56,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:13:56,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416855494] [2025-01-09 16:13:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416855494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:13:56,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:13:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:13:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578489833] [2025-01-09 16:13:56,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:13:56,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:13:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:13:56,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:13:56,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:13:56,126 INFO L87 Difference]: Start difference. First operand 379 states and 539 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:13:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:13:56,617 INFO L93 Difference]: Finished difference Result 914 states and 1296 transitions. [2025-01-09 16:13:56,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:13:56,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-01-09 16:13:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:13:56,623 INFO L225 Difference]: With dead ends: 914 [2025-01-09 16:13:56,623 INFO L226 Difference]: Without dead ends: 538 [2025-01-09 16:13:56,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:13:56,625 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 261 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:13:56,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 707 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:13:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-01-09 16:13:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 425. [2025-01-09 16:13:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 376 states have (on average 1.377659574468085) internal successors, (518), 377 states have internal predecessors, (518), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:13:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 600 transitions. [2025-01-09 16:13:56,666 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 600 transitions. Word has length 160 [2025-01-09 16:13:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:13:56,666 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 600 transitions. [2025-01-09 16:13:56,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:13:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 600 transitions. [2025-01-09 16:13:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 16:13:56,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:13:56,668 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:56,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:13:56,669 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:13:56,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:13:56,670 INFO L85 PathProgramCache]: Analyzing trace with hash 19274815, now seen corresponding path program 1 times [2025-01-09 16:13:56,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:13:56,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019726383] [2025-01-09 16:13:56,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:13:56,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:13:56,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 16:13:56,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 16:13:56,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:13:56,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:13:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:13:59,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:13:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019726383] [2025-01-09 16:13:59,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019726383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:13:59,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:13:59,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:13:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010177354] [2025-01-09 16:13:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:13:59,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:13:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:13:59,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:13:59,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:13:59,423 INFO L87 Difference]: Start difference. First operand 425 states and 600 transitions. Second operand has 11 states, 10 states have (on average 7.3) internal successors, (73), 11 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 16:14:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:00,531 INFO L93 Difference]: Finished difference Result 859 states and 1212 transitions. [2025-01-09 16:14:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:14:00,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.3) internal successors, (73), 11 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2025-01-09 16:14:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:00,534 INFO L225 Difference]: With dead ends: 859 [2025-01-09 16:14:00,534 INFO L226 Difference]: Without dead ends: 437 [2025-01-09 16:14:00,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:14:00,536 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 620 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:00,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 583 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:14:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-01-09 16:14:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 429. [2025-01-09 16:14:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 380 states have (on average 1.3736842105263158) internal successors, (522), 381 states have internal predecessors, (522), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:14:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 604 transitions. [2025-01-09 16:14:00,589 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 604 transitions. Word has length 160 [2025-01-09 16:14:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:00,590 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 604 transitions. [2025-01-09 16:14:00,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.3) internal successors, (73), 11 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 16:14:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 604 transitions. [2025-01-09 16:14:00,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 16:14:00,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:00,591 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:00,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:14:00,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:00,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:00,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1721900115, now seen corresponding path program 1 times [2025-01-09 16:14:00,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:00,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547707811] [2025-01-09 16:14:00,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:00,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:00,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 16:14:00,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 16:14:00,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:00,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:14:03,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:03,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547707811] [2025-01-09 16:14:03,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547707811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:03,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:03,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:14:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056224166] [2025-01-09 16:14:03,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:03,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:14:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:03,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:14:03,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:14:03,995 INFO L87 Difference]: Start difference. First operand 429 states and 604 transitions. Second operand has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 16:14:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:06,317 INFO L93 Difference]: Finished difference Result 829 states and 1171 transitions. [2025-01-09 16:14:06,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:14:06,317 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 160 [2025-01-09 16:14:06,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:06,321 INFO L225 Difference]: With dead ends: 829 [2025-01-09 16:14:06,321 INFO L226 Difference]: Without dead ends: 555 [2025-01-09 16:14:06,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:14:06,323 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 617 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:06,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1298 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 16:14:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-01-09 16:14:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 458. [2025-01-09 16:14:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 409 states have (on average 1.3838630806845966) internal successors, (566), 410 states have internal predecessors, (566), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:14:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 648 transitions. [2025-01-09 16:14:06,400 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 648 transitions. Word has length 160 [2025-01-09 16:14:06,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:06,400 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 648 transitions. [2025-01-09 16:14:06,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 16:14:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 648 transitions. [2025-01-09 16:14:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 16:14:06,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:06,402 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:06,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:14:06,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:06,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash 578922475, now seen corresponding path program 1 times [2025-01-09 16:14:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838723100] [2025-01-09 16:14:06,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:06,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 16:14:06,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 16:14:06,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:06,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 16:14:07,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:07,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838723100] [2025-01-09 16:14:07,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838723100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:07,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:07,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:14:07,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330131700] [2025-01-09 16:14:07,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:07,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:14:07,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:07,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:14:07,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:14:07,140 INFO L87 Difference]: Start difference. First operand 458 states and 648 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:14:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:07,842 INFO L93 Difference]: Finished difference Result 817 states and 1156 transitions. [2025-01-09 16:14:07,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:14:07,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-01-09 16:14:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:07,845 INFO L225 Difference]: With dead ends: 817 [2025-01-09 16:14:07,845 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 16:14:07,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:14:07,846 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 225 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:07,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 699 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:14:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 16:14:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 458. [2025-01-09 16:14:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 409 states have (on average 1.3789731051344742) internal successors, (564), 410 states have internal predecessors, (564), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:14:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 646 transitions. [2025-01-09 16:14:07,900 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 646 transitions. Word has length 160 [2025-01-09 16:14:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:07,901 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 646 transitions. [2025-01-09 16:14:07,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 16:14:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 646 transitions. [2025-01-09 16:14:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 16:14:07,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:07,902 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:07,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:14:07,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:07,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:07,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1020300241, now seen corresponding path program 1 times [2025-01-09 16:14:07,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:07,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904312823] [2025-01-09 16:14:07,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:07,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:07,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 16:14:08,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 16:14:08,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:08,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:08,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:14:08,503 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:395) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:871) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:795) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:207) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:155) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:292) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:227) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-01-09 16:14:08,509 INFO L158 Benchmark]: Toolchain (without parser) took 63636.36ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 122.1MB in the beginning and 324.2MB in the end (delta: -202.1MB). Peak memory consumption was 329.4MB. Max. memory is 16.1GB. [2025-01-09 16:14:08,509 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:14:08,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.03ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 104.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:14:08,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.02ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 100.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:14:08,510 INFO L158 Benchmark]: Boogie Preprocessor took 58.71ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 97.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:14:08,510 INFO L158 Benchmark]: RCFGBuilder took 875.10ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 55.5MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 16:14:08,510 INFO L158 Benchmark]: TraceAbstraction took 62283.25ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 55.0MB in the beginning and 324.2MB in the end (delta: -269.2MB). Peak memory consumption was 262.3MB. Max. memory is 16.1GB. [2025-01-09 16:14:08,513 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.03ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 104.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.02ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 100.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.71ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 97.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 875.10ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 55.5MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 62283.25ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 55.0MB in the beginning and 324.2MB in the end (delta: -269.2MB). Peak memory consumption was 262.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-01-09 16:14:08,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-sp_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:14:10,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:14:10,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:14:10,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:14:10,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:14:10,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:14:10,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:14:10,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:14:10,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:14:10,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:14:10,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:14:10,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:14:10,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:14:10,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:14:10,765 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:14:10,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:14:10,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:14:10,766 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:14:10,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:14:10,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:14:10,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:14:10,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:14:10,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:14:10,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:14:10,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:14:10,767 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:14:10,767 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:14:10,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:14:10,767 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:14:10,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:14:10,767 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:14:10,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:14:10,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:14:10,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:14:10,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:10,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:14:10,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:14:10,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:14:10,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:14:10,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:10,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:14:10,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:14:10,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:14:10,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:14:10,770 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:14:10,770 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:14:10,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:14:10,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:14:10,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:14:10,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:14:10,771 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 -> d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e [2025-01-09 16:14:11,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:14:11,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:14:11,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:14:11,054 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:14:11,054 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:14:11,055 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-sp_file-63.i [2025-01-09 16:14:12,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56986de8f/d38af97ab0db483c9e16d0160359eee9/FLAG1f006ae77 [2025-01-09 16:14:12,618 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:14:12,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2025-01-09 16:14:12,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56986de8f/d38af97ab0db483c9e16d0160359eee9/FLAG1f006ae77 [2025-01-09 16:14:12,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56986de8f/d38af97ab0db483c9e16d0160359eee9 [2025-01-09 16:14:12,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:14:12,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:14:12,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:14:12,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:14:12,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:14:12,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:14:12" (1/1) ... [2025-01-09 16:14:12,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f038f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:12, skipping insertion in model container [2025-01-09 16:14:12,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:14:12" (1/1) ... [2025-01-09 16:14:12,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:14:13,093 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-sp_file-63.i[917,930] [2025-01-09 16:14:13,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:14:13,170 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:14:13,179 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-sp_file-63.i[917,930] [2025-01-09 16:14:13,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:14:13,247 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:14:13,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13 WrapperNode [2025-01-09 16:14:13,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:14:13,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:14:13,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:14:13,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:14:13,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,320 INFO L138 Inliner]: procedures = 37, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 670 [2025-01-09 16:14:13,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:14:13,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:14:13,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:14:13,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:14:13,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,379 INFO L175 MemorySlicer]: Split 175 memory accesses to 2 slices as follows [2, 173]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2025-01-09 16:14:13,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,410 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:14:13,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:14:13,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:14:13,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:14:13,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:13" (1/1) ... [2025-01-09 16:14:13,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:13,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:13,478 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 16:14:13,481 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 16:14:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:14:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:14:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:14:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:14:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:14:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:14:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:14:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:14:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:14:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:14:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:14:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:14:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:14:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:14:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:14:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:14:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:14:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:14:13,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:14:13,502 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:14:13,502 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:14:13,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:14:13,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:14:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:14:13,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:14:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:14:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:14:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:14:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:14:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:14:13,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1