./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 05:59:06,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:59:06,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 05:59:06,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:59:06,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:59:06,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:59:06,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:59:06,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:59:06,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:59:06,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:59:06,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:59:06,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:59:06,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:59:06,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:59:06,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:59:06,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:59:06,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:59:06,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:59:06,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:59:06,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:59:06,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:59:06,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:59:06,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:59:06,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:59:06,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:59:06,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:59:06,868 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/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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2025-03-04 05:59:07,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:59:07,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:59:07,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:59:07,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:59:07,104 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:59:07,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2025-03-04 05:59:08,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46936b459/cd8a9b81757246a0b72ab35cd1f7b24b/FLAG773d95116 [2025-03-04 05:59:08,627 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:59:08,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2025-03-04 05:59:08,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46936b459/cd8a9b81757246a0b72ab35cd1f7b24b/FLAG773d95116 [2025-03-04 05:59:08,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46936b459/cd8a9b81757246a0b72ab35cd1f7b24b [2025-03-04 05:59:08,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:59:08,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:59:08,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:59:08,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:59:08,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:59:08,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:59:08" (1/1) ... [2025-03-04 05:59:08,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f88293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:08, skipping insertion in model container [2025-03-04 05:59:08,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:59:08" (1/1) ... [2025-03-04 05:59:08,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:59:08,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i[33519,33532] [2025-03-04 05:59:09,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:59:09,099 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:59:09,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i[33519,33532] [2025-03-04 05:59:09,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:59:09,219 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:59:09,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09 WrapperNode [2025-03-04 05:59:09,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:59:09,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:59:09,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:59:09,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:59:09,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,290 INFO L138 Inliner]: procedures = 176, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1503 [2025-03-04 05:59:09,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:59:09,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:59:09,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:59:09,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:59:09,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,381 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-03-04 05:59:09,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,427 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:59:09,453 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:59:09,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:59:09,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:59:09,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (1/1) ... [2025-03-04 05:59:09,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:59:09,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:09,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:59:09,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:59:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:59:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:59:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:59:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:59:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 05:59:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 05:59:09,505 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 05:59:09,506 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 05:59:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:59:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:59:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:59:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:59:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:59:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:59:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:59:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:59:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:59:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:59:09,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:59:09,689 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:59:09,691 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:59:10,954 INFO L? ?]: Removed 377 outVars from TransFormulas that were not future-live. [2025-03-04 05:59:10,954 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:59:11,018 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:59:11,019 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 05:59:11,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:59:11 BoogieIcfgContainer [2025-03-04 05:59:11,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:59:11,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:59:11,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:59:11,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:59:11,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:59:08" (1/3) ... [2025-03-04 05:59:11,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3516801a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:59:11, skipping insertion in model container [2025-03-04 05:59:11,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:59:09" (2/3) ... [2025-03-04 05:59:11,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3516801a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:59:11, skipping insertion in model container [2025-03-04 05:59:11,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:59:11" (3/3) ... [2025-03-04 05:59:11,029 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-1.i [2025-03-04 05:59:11,039 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:59:11,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test4-1.i that has 3 procedures, 399 locations, 1 initial locations, 34 loop locations, and 1 error locations. [2025-03-04 05:59:11,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:59:11,103 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;@2802da0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:59:11,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 05:59:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 395 states, 386 states have (on average 1.61139896373057) internal successors, (622), 387 states have internal predecessors, (622), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 05:59:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 05:59:11,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:11,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:11,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash -279212347, now seen corresponding path program 1 times [2025-03-04 05:59:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:11,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2308868] [2025-03-04 05:59:11,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:11,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 05:59:11,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 05:59:11,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:11,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:59:11,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:11,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2308868] [2025-03-04 05:59:11,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2308868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:11,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:11,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:59:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209678822] [2025-03-04 05:59:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:11,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:11,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:11,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:11,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:11,327 INFO L87 Difference]: Start difference. First operand has 395 states, 386 states have (on average 1.61139896373057) internal successors, (622), 387 states have internal predecessors, (622), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:59:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:11,797 INFO L93 Difference]: Finished difference Result 1104 states and 1778 transitions. [2025-03-04 05:59:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 05:59:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:11,813 INFO L225 Difference]: With dead ends: 1104 [2025-03-04 05:59:11,813 INFO L226 Difference]: Without dead ends: 707 [2025-03-04 05:59:11,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:11,822 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 462 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:11,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1502 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 05:59:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-04 05:59:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-03-04 05:59:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 696 states have (on average 1.4626436781609196) internal successors, (1018), 696 states have internal predecessors, (1018), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 05:59:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1036 transitions. [2025-03-04 05:59:11,896 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1036 transitions. Word has length 9 [2025-03-04 05:59:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:11,896 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1036 transitions. [2025-03-04 05:59:11,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:59:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1036 transitions. [2025-03-04 05:59:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 05:59:11,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:11,903 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:11,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:59:11,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:11,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1803085561, now seen corresponding path program 1 times [2025-03-04 05:59:11,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:11,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179543403] [2025-03-04 05:59:11,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:12,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 05:59:12,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 05:59:12,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:12,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:12,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:12,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179543403] [2025-03-04 05:59:12,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179543403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:12,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:12,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:59:12,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177412000] [2025-03-04 05:59:12,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:12,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:12,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:12,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:12,470 INFO L87 Difference]: Start difference. First operand 707 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:12,649 INFO L93 Difference]: Finished difference Result 1362 states and 1991 transitions. [2025-03-04 05:59:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:12,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-03-04 05:59:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:12,652 INFO L225 Difference]: With dead ends: 1362 [2025-03-04 05:59:12,653 INFO L226 Difference]: Without dead ends: 713 [2025-03-04 05:59:12,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:12,657 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 105 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:12,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1407 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-04 05:59:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 707. [2025-03-04 05:59:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 696 states have (on average 1.4425287356321839) internal successors, (1004), 696 states have internal predecessors, (1004), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 05:59:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1022 transitions. [2025-03-04 05:59:12,696 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1022 transitions. Word has length 166 [2025-03-04 05:59:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:12,696 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1022 transitions. [2025-03-04 05:59:12,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1022 transitions. [2025-03-04 05:59:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 05:59:12,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:12,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:12,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:59:12,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:12,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2025014849, now seen corresponding path program 1 times [2025-03-04 05:59:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:12,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369721763] [2025-03-04 05:59:12,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:12,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 05:59:12,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 05:59:12,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:12,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369721763] [2025-03-04 05:59:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369721763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:13,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:59:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505986006] [2025-03-04 05:59:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:13,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:59:13,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:13,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:59:13,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:13,021 INFO L87 Difference]: Start difference. First operand 707 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:13,156 INFO L93 Difference]: Finished difference Result 1272 states and 1840 transitions. [2025-03-04 05:59:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:59:13,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-03-04 05:59:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:13,159 INFO L225 Difference]: With dead ends: 1272 [2025-03-04 05:59:13,160 INFO L226 Difference]: Without dead ends: 705 [2025-03-04 05:59:13,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:13,162 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 134 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:13,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1024 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-04 05:59:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2025-03-04 05:59:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 694 states have (on average 1.442363112391931) internal successors, (1001), 694 states have internal predecessors, (1001), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 05:59:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1019 transitions. [2025-03-04 05:59:13,183 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1019 transitions. Word has length 166 [2025-03-04 05:59:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:13,184 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1019 transitions. [2025-03-04 05:59:13,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1019 transitions. [2025-03-04 05:59:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 05:59:13,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:13,186 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:13,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:59:13,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:13,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:13,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1954005169, now seen corresponding path program 1 times [2025-03-04 05:59:13,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:13,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689660170] [2025-03-04 05:59:13,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:13,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:13,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 05:59:13,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 05:59:13,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:13,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 05:59:13,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:13,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689660170] [2025-03-04 05:59:13,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689660170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:13,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:13,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:59:13,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115882229] [2025-03-04 05:59:13,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:13,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:13,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:13,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:13,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:13,504 INFO L87 Difference]: Start difference. First operand 705 states and 1019 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 05:59:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:13,637 INFO L93 Difference]: Finished difference Result 1173 states and 1693 transitions. [2025-03-04 05:59:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 181 [2025-03-04 05:59:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:13,640 INFO L225 Difference]: With dead ends: 1173 [2025-03-04 05:59:13,640 INFO L226 Difference]: Without dead ends: 711 [2025-03-04 05:59:13,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:13,642 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 105 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:13,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1386 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-04 05:59:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 705. [2025-03-04 05:59:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 694 states have (on average 1.4221902017291066) internal successors, (987), 694 states have internal predecessors, (987), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 05:59:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1005 transitions. [2025-03-04 05:59:13,661 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1005 transitions. Word has length 181 [2025-03-04 05:59:13,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:13,662 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1005 transitions. [2025-03-04 05:59:13,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 05:59:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1005 transitions. [2025-03-04 05:59:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 05:59:13,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:13,664 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:13,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:59:13,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:13,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -869218422, now seen corresponding path program 1 times [2025-03-04 05:59:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:13,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134342026] [2025-03-04 05:59:13,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:13,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 05:59:14,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 05:59:14,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:14,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:59:14,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:14,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134342026] [2025-03-04 05:59:14,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134342026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:14,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86220542] [2025-03-04 05:59:14,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:14,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:14,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:14,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:14,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 05:59:14,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 05:59:15,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 05:59:15,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:15,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:15,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 05:59:15,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:15,164 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 22 treesize of output 7 [2025-03-04 05:59:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 05:59:15,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:15,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86220542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:15,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:15,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 05:59:15,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427338545] [2025-03-04 05:59:15,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:15,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 05:59:15,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:15,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 05:59:15,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 05:59:15,826 INFO L87 Difference]: Start difference. First operand 705 states and 1005 transitions. Second operand has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:17,760 INFO L93 Difference]: Finished difference Result 1435 states and 2034 transitions. [2025-03-04 05:59:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 05:59:17,762 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 181 [2025-03-04 05:59:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:17,766 INFO L225 Difference]: With dead ends: 1435 [2025-03-04 05:59:17,766 INFO L226 Difference]: Without dead ends: 814 [2025-03-04 05:59:17,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-04 05:59:17,768 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 795 mSDsluCounter, 2348 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:17,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 2855 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 05:59:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-03-04 05:59:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 730. [2025-03-04 05:59:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 719 states have (on average 1.4144645340751043) internal successors, (1017), 719 states have internal predecessors, (1017), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 05:59:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1035 transitions. [2025-03-04 05:59:17,791 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1035 transitions. Word has length 181 [2025-03-04 05:59:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1035 transitions. [2025-03-04 05:59:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1035 transitions. [2025-03-04 05:59:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-04 05:59:17,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:17,793 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:17,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:17,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:17,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:17,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash -85263178, now seen corresponding path program 1 times [2025-03-04 05:59:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:17,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826611921] [2025-03-04 05:59:17,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:18,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 05:59:18,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 05:59:18,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:18,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:59:18,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826611921] [2025-03-04 05:59:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826611921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281130067] [2025-03-04 05:59:18,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:18,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:18,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:18,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:18,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 05:59:18,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 05:59:19,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 05:59:19,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:19,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:19,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 05:59:19,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 05:59:19,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:19,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281130067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:19,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:19,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 05:59:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961193335] [2025-03-04 05:59:19,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:19,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:19,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:19,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:19,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:19,074 INFO L87 Difference]: Start difference. First operand 730 states and 1035 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:19,303 INFO L93 Difference]: Finished difference Result 1394 states and 1980 transitions. [2025-03-04 05:59:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:19,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2025-03-04 05:59:19,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:19,306 INFO L225 Difference]: With dead ends: 1394 [2025-03-04 05:59:19,307 INFO L226 Difference]: Without dead ends: 773 [2025-03-04 05:59:19,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:19,308 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 17 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:19,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1340 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-03-04 05:59:19,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 757. [2025-03-04 05:59:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 746 states have (on average 1.4075067024128687) internal successors, (1050), 746 states have internal predecessors, (1050), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 05:59:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1068 transitions. [2025-03-04 05:59:19,324 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1068 transitions. Word has length 182 [2025-03-04 05:59:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:19,324 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1068 transitions. [2025-03-04 05:59:19,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1068 transitions. [2025-03-04 05:59:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-04 05:59:19,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:19,326 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:19,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:19,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 05:59:19,527 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:19,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:19,527 INFO L85 PathProgramCache]: Analyzing trace with hash -436355763, now seen corresponding path program 1 times [2025-03-04 05:59:19,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:19,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107713557] [2025-03-04 05:59:19,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:19,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:19,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 05:59:19,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 05:59:19,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:19,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 05:59:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:19,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107713557] [2025-03-04 05:59:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107713557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:19,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:19,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:59:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886316659] [2025-03-04 05:59:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:19,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:19,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:19,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:19,915 INFO L87 Difference]: Start difference. First operand 757 states and 1068 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:20,357 INFO L93 Difference]: Finished difference Result 1413 states and 1999 transitions. [2025-03-04 05:59:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:20,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2025-03-04 05:59:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:20,360 INFO L225 Difference]: With dead ends: 1413 [2025-03-04 05:59:20,360 INFO L226 Difference]: Without dead ends: 769 [2025-03-04 05:59:20,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:20,362 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 8 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:20,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2033 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 05:59:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-03-04 05:59:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 765. [2025-03-04 05:59:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 754 states have (on average 1.4058355437665782) internal successors, (1060), 754 states have internal predecessors, (1060), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 05:59:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1078 transitions. [2025-03-04 05:59:20,377 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1078 transitions. Word has length 183 [2025-03-04 05:59:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:20,377 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1078 transitions. [2025-03-04 05:59:20,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1078 transitions. [2025-03-04 05:59:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 05:59:20,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:20,379 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:20,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 05:59:20,379 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:20,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:20,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2050763430, now seen corresponding path program 1 times [2025-03-04 05:59:20,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:20,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081257640] [2025-03-04 05:59:20,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:20,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 05:59:20,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 05:59:20,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:20,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 05:59:20,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:20,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081257640] [2025-03-04 05:59:20,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081257640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:20,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:20,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 05:59:20,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368984486] [2025-03-04 05:59:20,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:20,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:20,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:20,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:20,733 INFO L87 Difference]: Start difference. First operand 765 states and 1078 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:21,249 INFO L93 Difference]: Finished difference Result 1428 states and 2019 transitions. [2025-03-04 05:59:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:21,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-04 05:59:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:21,253 INFO L225 Difference]: With dead ends: 1428 [2025-03-04 05:59:21,253 INFO L226 Difference]: Without dead ends: 787 [2025-03-04 05:59:21,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:21,255 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 12 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:21,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2411 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-04 05:59:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 781. [2025-03-04 05:59:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 770 states have (on average 1.405194805194805) internal successors, (1082), 770 states have internal predecessors, (1082), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 05:59:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1100 transitions. [2025-03-04 05:59:21,276 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1100 transitions. Word has length 184 [2025-03-04 05:59:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:21,276 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1100 transitions. [2025-03-04 05:59:21,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1100 transitions. [2025-03-04 05:59:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 05:59:21,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:21,278 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:21,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:59:21,278 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:21,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2018039671, now seen corresponding path program 1 times [2025-03-04 05:59:21,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:21,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312174156] [2025-03-04 05:59:21,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:21,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 05:59:21,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 05:59:21,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:21,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 05:59:21,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:21,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312174156] [2025-03-04 05:59:21,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312174156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:21,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40416803] [2025-03-04 05:59:21,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:21,727 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:21,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 05:59:21,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 05:59:22,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 05:59:22,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:22,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:22,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 05:59:22,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 05:59:22,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:22,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40416803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:22,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:22,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2025-03-04 05:59:22,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132939646] [2025-03-04 05:59:22,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:22,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:59:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:22,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:59:22,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:22,253 INFO L87 Difference]: Start difference. First operand 781 states and 1100 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 05:59:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:22,458 INFO L93 Difference]: Finished difference Result 1454 states and 2055 transitions. [2025-03-04 05:59:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:59:22,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 184 [2025-03-04 05:59:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:22,465 INFO L225 Difference]: With dead ends: 1454 [2025-03-04 05:59:22,465 INFO L226 Difference]: Without dead ends: 845 [2025-03-04 05:59:22,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:22,467 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 519 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:22,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 2002 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-04 05:59:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 784. [2025-03-04 05:59:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 772 states have (on average 1.4054404145077721) internal successors, (1085), 773 states have internal predecessors, (1085), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 05:59:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1106 transitions. [2025-03-04 05:59:22,491 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1106 transitions. Word has length 184 [2025-03-04 05:59:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:22,491 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1106 transitions. [2025-03-04 05:59:22,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 05:59:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1106 transitions. [2025-03-04 05:59:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 05:59:22,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:22,495 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:22,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:22,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:22,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:22,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:22,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1239148097, now seen corresponding path program 1 times [2025-03-04 05:59:22,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:22,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925456123] [2025-03-04 05:59:22,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:22,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:22,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 05:59:23,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 05:59:23,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:23,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:59:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925456123] [2025-03-04 05:59:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925456123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291138988] [2025-03-04 05:59:23,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:23,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:23,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:23,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:23,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 05:59:23,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 05:59:23,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 05:59:23,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:23,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:23,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 05:59:23,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 05:59:24,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:24,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291138988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:24,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:24,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 05:59:24,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417666522] [2025-03-04 05:59:24,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:24,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:24,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:24,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:24,093 INFO L87 Difference]: Start difference. First operand 784 states and 1106 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:24,660 INFO L93 Difference]: Finished difference Result 1450 states and 2052 transitions. [2025-03-04 05:59:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:24,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2025-03-04 05:59:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:24,664 INFO L225 Difference]: With dead ends: 1450 [2025-03-04 05:59:24,664 INFO L226 Difference]: Without dead ends: 798 [2025-03-04 05:59:24,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:24,665 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 12 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:24,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2417 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-04 05:59:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 784. [2025-03-04 05:59:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 772 states have (on average 1.4054404145077721) internal successors, (1085), 773 states have internal predecessors, (1085), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 05:59:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1106 transitions. [2025-03-04 05:59:24,686 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1106 transitions. Word has length 188 [2025-03-04 05:59:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:24,686 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1106 transitions. [2025-03-04 05:59:24,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1106 transitions. [2025-03-04 05:59:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 05:59:24,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:24,689 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:24,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:24,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:24,890 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:24,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:24,890 INFO L85 PathProgramCache]: Analyzing trace with hash 21322476, now seen corresponding path program 1 times [2025-03-04 05:59:24,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:24,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722921195] [2025-03-04 05:59:24,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:24,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:24,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 05:59:24,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 05:59:24,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:24,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 05:59:25,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:25,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722921195] [2025-03-04 05:59:25,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722921195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:25,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:25,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 05:59:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301483448] [2025-03-04 05:59:25,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:25,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 05:59:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:25,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 05:59:25,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:25,291 INFO L87 Difference]: Start difference. First operand 784 states and 1106 transitions. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:25,840 INFO L93 Difference]: Finished difference Result 1457 states and 2058 transitions. [2025-03-04 05:59:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 05:59:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2025-03-04 05:59:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:25,844 INFO L225 Difference]: With dead ends: 1457 [2025-03-04 05:59:25,844 INFO L226 Difference]: Without dead ends: 810 [2025-03-04 05:59:25,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:25,846 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 20 mSDsluCounter, 2441 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:25,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2934 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-03-04 05:59:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 798. [2025-03-04 05:59:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 786 states have (on average 1.4033078880407124) internal successors, (1103), 787 states have internal predecessors, (1103), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 05:59:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1124 transitions. [2025-03-04 05:59:25,869 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1124 transitions. Word has length 189 [2025-03-04 05:59:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:25,869 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1124 transitions. [2025-03-04 05:59:25,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1124 transitions. [2025-03-04 05:59:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 05:59:25,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:25,871 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:25,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 05:59:25,871 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:25,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash 832679197, now seen corresponding path program 1 times [2025-03-04 05:59:25,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:25,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71559213] [2025-03-04 05:59:25,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:25,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 05:59:26,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 05:59:26,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:26,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:59:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71559213] [2025-03-04 05:59:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71559213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863464358] [2025-03-04 05:59:26,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:26,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:26,434 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:26,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 05:59:26,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 05:59:26,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 05:59:26,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:26,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:26,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 05:59:26,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 05:59:27,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:27,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863464358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:27,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:27,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-03-04 05:59:27,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465878794] [2025-03-04 05:59:27,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:27,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 05:59:27,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:27,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 05:59:27,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 05:59:27,046 INFO L87 Difference]: Start difference. First operand 798 states and 1124 transitions. Second operand has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:27,548 INFO L93 Difference]: Finished difference Result 1482 states and 2089 transitions. [2025-03-04 05:59:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 05:59:27,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2025-03-04 05:59:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:27,551 INFO L225 Difference]: With dead ends: 1482 [2025-03-04 05:59:27,552 INFO L226 Difference]: Without dead ends: 828 [2025-03-04 05:59:27,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 05:59:27,553 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 40 mSDsluCounter, 2392 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:27,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2891 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-03-04 05:59:27,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 808. [2025-03-04 05:59:27,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 796 states have (on average 1.400753768844221) internal successors, (1115), 797 states have internal predecessors, (1115), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 05:59:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1136 transitions. [2025-03-04 05:59:27,571 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1136 transitions. Word has length 189 [2025-03-04 05:59:27,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:27,571 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1136 transitions. [2025-03-04 05:59:27,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1136 transitions. [2025-03-04 05:59:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 05:59:27,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:27,574 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:27,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:27,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 05:59:27,774 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:27,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash -764550183, now seen corresponding path program 1 times [2025-03-04 05:59:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:27,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593675830] [2025-03-04 05:59:27,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:27,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 05:59:27,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 05:59:27,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:27,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 05:59:28,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:28,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593675830] [2025-03-04 05:59:28,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593675830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:28,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:28,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 05:59:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062984299] [2025-03-04 05:59:28,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:28,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 05:59:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:28,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 05:59:28,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:28,213 INFO L87 Difference]: Start difference. First operand 808 states and 1136 transitions. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:28,801 INFO L93 Difference]: Finished difference Result 1490 states and 2101 transitions. [2025-03-04 05:59:28,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 05:59:28,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2025-03-04 05:59:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:28,804 INFO L225 Difference]: With dead ends: 1490 [2025-03-04 05:59:28,804 INFO L226 Difference]: Without dead ends: 826 [2025-03-04 05:59:28,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 05:59:28,806 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 23 mSDsluCounter, 2771 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:28,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3270 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-04 05:59:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 814. [2025-03-04 05:59:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 802 states have (on average 1.3977556109725686) internal successors, (1121), 803 states have internal predecessors, (1121), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 05:59:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1142 transitions. [2025-03-04 05:59:28,822 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1142 transitions. Word has length 190 [2025-03-04 05:59:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:28,822 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1142 transitions. [2025-03-04 05:59:28,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1142 transitions. [2025-03-04 05:59:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 05:59:28,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:28,823 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:28,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:59:28,824 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1425565992, now seen corresponding path program 1 times [2025-03-04 05:59:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:28,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980032265] [2025-03-04 05:59:28,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:28,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 05:59:29,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 05:59:29,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:29,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:59:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:29,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980032265] [2025-03-04 05:59:29,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980032265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:29,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114585496] [2025-03-04 05:59:29,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:29,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:29,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:29,309 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:29,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 05:59:29,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 05:59:29,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 05:59:29,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:29,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:29,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 05:59:29,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 05:59:29,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:29,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114585496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:29,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:29,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 05:59:29,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007245080] [2025-03-04 05:59:29,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:29,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:29,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:29,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:29,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:29,944 INFO L87 Difference]: Start difference. First operand 814 states and 1142 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:30,419 INFO L93 Difference]: Finished difference Result 1504 states and 2118 transitions. [2025-03-04 05:59:30,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 05:59:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2025-03-04 05:59:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:30,422 INFO L225 Difference]: With dead ends: 1504 [2025-03-04 05:59:30,422 INFO L226 Difference]: Without dead ends: 842 [2025-03-04 05:59:30,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 05:59:30,423 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 39 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:30,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2489 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 05:59:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-04 05:59:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 818. [2025-03-04 05:59:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 806 states have (on average 1.400744416873449) internal successors, (1129), 807 states have internal predecessors, (1129), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 05:59:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1150 transitions. [2025-03-04 05:59:30,446 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1150 transitions. Word has length 190 [2025-03-04 05:59:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:30,447 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1150 transitions. [2025-03-04 05:59:30,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 05:59:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1150 transitions. [2025-03-04 05:59:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 05:59:30,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:30,451 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:30,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 05:59:30,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:30,652 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:30,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1234306148, now seen corresponding path program 1 times [2025-03-04 05:59:30,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:30,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495571774] [2025-03-04 05:59:30,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:30,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:30,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 05:59:30,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 05:59:30,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:30,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:59:31,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:31,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495571774] [2025-03-04 05:59:31,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495571774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:31,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562825915] [2025-03-04 05:59:31,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:31,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:31,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:31,159 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:31,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 05:59:31,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 05:59:31,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 05:59:31,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:31,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:31,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 154 conjuncts are in the unsatisfiable core [2025-03-04 05:59:31,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:31,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 05:59:31,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-04 05:59:32,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-04 05:59:32,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-04 05:59:32,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 05:59:32,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 05:59:32,196 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 05:59:32,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 05:59:32,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 05:59:32,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 05:59:32,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 05:59:32,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 05:59:32,422 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 05:59:32,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-03-04 05:59:32,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2025-03-04 05:59:32,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11