./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1lif.c --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/array-fpi/s1lif.c -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 cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:39:13,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:39:13,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:39:13,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:39:13,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:39:13,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:39:13,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:39:13,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:39:13,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:39:13,354 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:39:13,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:39:13,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:39:13,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:39:13,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:39:13,356 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:39:13,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:39:13,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:39:13,356 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:39:13,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:39:13,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:39:13,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:39:13,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:39:13,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:39:13,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:39:13,357 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:39:13,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:39:13,357 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:39:13,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:39:13,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:39:13,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:39:13,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:39:13,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:39:13,358 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 -> cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf [2025-03-03 09:39:13,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:39:13,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:39:13,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:39:13,608 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:39:13,609 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:39:13,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1lif.c [2025-03-03 09:39:14,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890e0f94a/de116a9bf1344876b545df2d7850d2f6/FLAGaaff7d6af [2025-03-03 09:39:14,988 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:39:14,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1lif.c [2025-03-03 09:39:14,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890e0f94a/de116a9bf1344876b545df2d7850d2f6/FLAGaaff7d6af [2025-03-03 09:39:15,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890e0f94a/de116a9bf1344876b545df2d7850d2f6 [2025-03-03 09:39:15,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:39:15,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:39:15,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:39:15,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:39:15,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:39:15,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c0459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15, skipping insertion in model container [2025-03-03 09:39:15,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:39:15,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/array-fpi/s1lif.c[588,601] [2025-03-03 09:39:15,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:39:15,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:39:15,167 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/array-fpi/s1lif.c[588,601] [2025-03-03 09:39:15,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:39:15,188 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:39:15,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15 WrapperNode [2025-03-03 09:39:15,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:39:15,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:39:15,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:39:15,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:39:15,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,217 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2025-03-03 09:39:15,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:39:15,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:39:15,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:39:15,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:39:15,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,244 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 8, 4, 7]. 38 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 5 writes are split as follows [0, 0, 2, 3]. [2025-03-03 09:39:15,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,251 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:39:15,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:39:15,255 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:39:15,255 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:39:15,255 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (1/1) ... [2025-03-03 09:39:15,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:39:15,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:15,277 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-03 09:39:15,281 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-03 09:39:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:39:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:39:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:39:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:39:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 09:39:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:39:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:39:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:39:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:39:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 09:39:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 09:39:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:39:15,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:39:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:39:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:39:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:39:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 09:39:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:39:15,361 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:39:15,363 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:39:15,477 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-03 09:39:15,481 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:39:15,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:39:15,487 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:39:15,487 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:39:15,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:39:15 BoogieIcfgContainer [2025-03-03 09:39:15,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:39:15,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:39:15,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:39:15,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:39:15,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:39:15" (1/3) ... [2025-03-03 09:39:15,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5c6e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:39:15, skipping insertion in model container [2025-03-03 09:39:15,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:15" (2/3) ... [2025-03-03 09:39:15,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5c6e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:39:15, skipping insertion in model container [2025-03-03 09:39:15,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:39:15" (3/3) ... [2025-03-03 09:39:15,494 INFO L128 eAbstractionObserver]: Analyzing ICFG s1lif.c [2025-03-03 09:39:15,507 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:39:15,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s1lif.c that has 1 procedures, 17 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:39:15,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:39:15,559 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;@1337a89e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:39:15,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:39:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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-03 09:39:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 09:39:15,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:15,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:15,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:15,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:15,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1915737109, now seen corresponding path program 1 times [2025-03-03 09:39:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941760513] [2025-03-03 09:39:15,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:15,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:15,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 09:39:15,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 09:39:15,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:15,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:15,682 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-03 09:39:15,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:15,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941760513] [2025-03-03 09:39:15,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941760513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:39:15,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:39:15,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:39:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087452073] [2025-03-03 09:39:15,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:39:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:39:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:15,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:39:15,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:39:15,700 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-03 09:39:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:15,707 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-03-03 09:39:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:39:15,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2025-03-03 09:39:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:15,711 INFO L225 Difference]: With dead ends: 30 [2025-03-03 09:39:15,712 INFO L226 Difference]: Without dead ends: 13 [2025-03-03 09:39:15,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:39:15,715 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:15,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:39:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-03 09:39:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-03 09:39:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-03 09:39:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-03-03 09:39:15,736 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2025-03-03 09:39:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:15,737 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-03 09:39:15,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-03 09:39:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-03-03 09:39:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 09:39:15,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:15,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:15,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:39:15,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:15,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:15,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1491726506, now seen corresponding path program 1 times [2025-03-03 09:39:15,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:15,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133617501] [2025-03-03 09:39:15,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:15,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:15,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 09:39:15,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 09:39:15,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:15,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:15,875 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-03 09:39:15,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133617501] [2025-03-03 09:39:15,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133617501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:39:15,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:39:15,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:39:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821300756] [2025-03-03 09:39:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:39:15,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:39:15,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:15,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:39:15,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:39:15,877 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-03 09:39:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:15,930 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2025-03-03 09:39:15,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:39:15,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-03 09:39:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:15,932 INFO L225 Difference]: With dead ends: 25 [2025-03-03 09:39:15,932 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 09:39:15,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:39:15,933 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:15,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:39:15,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 09:39:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-03 09:39:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-03 09:39:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-03-03 09:39:15,940 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2025-03-03 09:39:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:15,940 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-03 09:39:15,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-03 09:39:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-03-03 09:39:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 09:39:15,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:15,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:15,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:39:15,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:15,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:15,941 INFO L85 PathProgramCache]: Analyzing trace with hash 322328624, now seen corresponding path program 1 times [2025-03-03 09:39:15,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:15,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075242532] [2025-03-03 09:39:15,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:15,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:15,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:39:15,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:39:15,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:15,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:16,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075242532] [2025-03-03 09:39:16,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075242532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591204283] [2025-03-03 09:39:16,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:16,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:16,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:16,782 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-03 09:39:16,784 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-03 09:39:16,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:39:16,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:39:16,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:16,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:16,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 09:39:16,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:16,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:39:17,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:17,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:17,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:17,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-03 09:39:17,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:17,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2025-03-03 09:39:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:17,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591204283] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:17,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:17,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2025-03-03 09:39:17,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703733029] [2025-03-03 09:39:17,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:17,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:39:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:17,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:39:17,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:39:17,304 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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-03 09:39:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:17,625 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-03-03 09:39:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:39:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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 15 [2025-03-03 09:39:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:17,626 INFO L225 Difference]: With dead ends: 38 [2025-03-03 09:39:17,627 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 09:39:17,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:39:17,628 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:17,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 43 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 09:39:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2025-03-03 09:39:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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-03 09:39:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-03 09:39:17,635 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2025-03-03 09:39:17,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:17,635 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-03 09:39:17,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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-03 09:39:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-03 09:39:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 09:39:17,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:17,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:17,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:39:17,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:17,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:17,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1209832305, now seen corresponding path program 1 times [2025-03-03 09:39:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117302370] [2025-03-03 09:39:17,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:17,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:39:17,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:39:17,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:17,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117302370] [2025-03-03 09:39:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117302370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138374529] [2025-03-03 09:39:17,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:17,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:17,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:17,985 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-03 09:39:17,986 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-03 09:39:18,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:39:18,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:39:18,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:18,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:18,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:39:18,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:18,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:39:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:18,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:18,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-03 09:39:18,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-03 09:39:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:18,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138374529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:18,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:18,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 09:39:18,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451854975] [2025-03-03 09:39:18,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:18,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:39:18,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:18,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:39:18,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:39:18,098 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-03 09:39:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:18,141 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-03-03 09:39:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:39:18,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 15 [2025-03-03 09:39:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:18,142 INFO L225 Difference]: With dead ends: 35 [2025-03-03 09:39:18,142 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 09:39:18,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:39:18,143 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:18,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:39:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 09:39:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-03 09:39:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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-03 09:39:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-03 09:39:18,147 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2025-03-03 09:39:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:18,147 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-03 09:39:18,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-03 09:39:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-03 09:39:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:39:18,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:18,147 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:18,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:39:18,352 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,SelfDestructingSolverStorable3 [2025-03-03 09:39:18,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:18,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:18,355 INFO L85 PathProgramCache]: Analyzing trace with hash -493973740, now seen corresponding path program 2 times [2025-03-03 09:39:18,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:18,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068152475] [2025-03-03 09:39:18,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:18,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:18,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-03 09:39:18,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:39:18,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:18,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:18,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:18,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068152475] [2025-03-03 09:39:18,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068152475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:18,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121655724] [2025-03-03 09:39:18,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:18,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:18,422 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-03 09:39:18,424 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-03 09:39:18,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-03 09:39:18,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:39:18,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:18,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:18,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:39:18,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:18,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:18,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121655724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:18,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:18,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:39:18,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50562505] [2025-03-03 09:39:18,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:18,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:39:18,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:18,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:39:18,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:39:18,547 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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-03 09:39:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:18,643 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-03-03 09:39:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:39:18,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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 16 [2025-03-03 09:39:18,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:18,643 INFO L225 Difference]: With dead ends: 39 [2025-03-03 09:39:18,644 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 09:39:18,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:39:18,644 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:18,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 26 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 09:39:18,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2025-03-03 09:39:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-03 09:39:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-03 09:39:18,648 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2025-03-03 09:39:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:18,648 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-03 09:39:18,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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-03 09:39:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-03 09:39:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:39:18,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:18,649 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:18,655 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-03 09:39:18,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:18,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1402284501, now seen corresponding path program 3 times [2025-03-03 09:39:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428796592] [2025-03-03 09:39:18,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:18,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-03 09:39:18,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:39:18,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:39:18,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:18,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:18,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428796592] [2025-03-03 09:39:18,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428796592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:18,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370366709] [2025-03-03 09:39:18,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:18,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:18,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:18,932 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-03 09:39:18,934 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-03 09:39:18,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-03 09:39:18,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:39:18,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:39:18,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:18,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:39:18,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:19,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:19,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370366709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:19,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:19,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:39:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814187494] [2025-03-03 09:39:19,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:19,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:39:19,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:19,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:39:19,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:39:19,061 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-03 09:39:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:19,113 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-03-03 09:39:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:39:19,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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 16 [2025-03-03 09:39:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:19,114 INFO L225 Difference]: With dead ends: 38 [2025-03-03 09:39:19,114 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 09:39:19,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:39:19,115 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:19,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 24 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:39:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 09:39:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-03 09:39:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-03 09:39:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-03 09:39:19,119 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2025-03-03 09:39:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:19,119 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-03 09:39:19,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-03 09:39:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-03 09:39:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:39:19,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:19,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:19,126 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-03 09:39:19,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:19,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:19,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash -96415722, now seen corresponding path program 4 times [2025-03-03 09:39:19,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:19,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381424915] [2025-03-03 09:39:19,320 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:39:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:19,326 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-03 09:39:19,340 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:39:19,341 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:39:19,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:20,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:20,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381424915] [2025-03-03 09:39:20,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381424915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:20,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794622691] [2025-03-03 09:39:20,215 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:39:20,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:20,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:20,217 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-03 09:39:20,219 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-03 09:39:20,256 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-03 09:39:20,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:39:20,272 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:39:20,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:20,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 09:39:20,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:20,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:39:20,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:20,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:20,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:39:20,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:20,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:20,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:21,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2025-03-03 09:39:21,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:21,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 394 treesize of output 391 [2025-03-03 09:39:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794622691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:21,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2025-03-03 09:39:21,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71574647] [2025-03-03 09:39:21,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 09:39:21,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:21,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 09:39:21,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1433, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:39:21,276 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 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-03 09:39:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:24,019 INFO L93 Difference]: Finished difference Result 98 states and 132 transitions. [2025-03-03 09:39:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-03 09:39:24,019 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 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 20 [2025-03-03 09:39:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:24,021 INFO L225 Difference]: With dead ends: 98 [2025-03-03 09:39:24,021 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 09:39:24,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2169 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=942, Invalid=6714, Unknown=0, NotChecked=0, Total=7656 [2025-03-03 09:39:24,026 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 108 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:24,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 116 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:39:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 09:39:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2025-03-03 09:39:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 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-03 09:39:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2025-03-03 09:39:24,036 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 20 [2025-03-03 09:39:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:24,036 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2025-03-03 09:39:24,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 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-03 09:39:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2025-03-03 09:39:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:39:24,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:24,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:24,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:39:24,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:24,238 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:24,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1646394613, now seen corresponding path program 1 times [2025-03-03 09:39:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:24,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478128691] [2025-03-03 09:39:24,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:24,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:39:24,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:39:24,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:24,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:39:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478128691] [2025-03-03 09:39:24,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478128691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120363076] [2025-03-03 09:39:24,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:24,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:24,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:24,429 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-03 09:39:24,431 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-03 09:39:24,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:39:24,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:39:24,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:24,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:24,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 09:39:24,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:24,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:39:24,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:39:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:39:24,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:24,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-03 09:39:24,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:39:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:39:24,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120363076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:24,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:24,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-03 09:39:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636706993] [2025-03-03 09:39:24,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:24,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:39:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:24,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:39:24,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:39:24,587 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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-03 09:39:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:24,650 INFO L93 Difference]: Finished difference Result 79 states and 110 transitions. [2025-03-03 09:39:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:39:24,651 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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 20 [2025-03-03 09:39:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:24,652 INFO L225 Difference]: With dead ends: 79 [2025-03-03 09:39:24,652 INFO L226 Difference]: Without dead ends: 52 [2025-03-03 09:39:24,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:39:24,652 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:24,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-03 09:39:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2025-03-03 09:39:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 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-03 09:39:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2025-03-03 09:39:24,662 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 20 [2025-03-03 09:39:24,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:24,662 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2025-03-03 09:39:24,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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-03 09:39:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2025-03-03 09:39:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:39:24,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:24,663 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:24,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:24,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:24,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:24,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1398061134, now seen corresponding path program 5 times [2025-03-03 09:39:24,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:24,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567318926] [2025-03-03 09:39:24,867 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:39:24,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:24,873 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-03 09:39:24,879 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:39:24,880 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:39:24,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:24,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567318926] [2025-03-03 09:39:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567318926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:24,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130087732] [2025-03-03 09:39:24,931 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:39:24,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:24,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:24,933 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-03 09:39:24,942 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-03 09:39:24,973 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-03 09:39:24,992 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:39:24,992 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:39:24,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:24,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:39:24,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:25,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:25,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130087732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:25,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:25,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-03 09:39:25,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362113007] [2025-03-03 09:39:25,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:25,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:39:25,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:25,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:39:25,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:39:25,082 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 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-03 09:39:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:25,211 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2025-03-03 09:39:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:39:25,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 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 21 [2025-03-03 09:39:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:25,212 INFO L225 Difference]: With dead ends: 65 [2025-03-03 09:39:25,212 INFO L226 Difference]: Without dead ends: 59 [2025-03-03 09:39:25,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:39:25,212 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:25,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 21 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-03 09:39:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2025-03-03 09:39:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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-03 09:39:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-03 09:39:25,219 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2025-03-03 09:39:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:25,220 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-03 09:39:25,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 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-03 09:39:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-03 09:39:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:39:25,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:25,220 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:25,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:25,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:25,425 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111663, now seen corresponding path program 6 times [2025-03-03 09:39:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:25,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373680231] [2025-03-03 09:39:25,425 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:39:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:25,431 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-03 09:39:25,437 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:39:25,437 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 09:39:25,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:25,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373680231] [2025-03-03 09:39:25,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373680231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599990986] [2025-03-03 09:39:25,492 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:39:25,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:25,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:25,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:39:25,532 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-03 09:39:25,547 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:39:25,547 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 09:39:25,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:25,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:39:25,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:25,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:25,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599990986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:25,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:25,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:39:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729633921] [2025-03-03 09:39:25,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:25,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:39:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:25,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:39:25,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:39:25,623 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-03 09:39:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:25,694 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-03 09:39:25,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:39:25,694 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 21 [2025-03-03 09:39:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:25,695 INFO L225 Difference]: With dead ends: 49 [2025-03-03 09:39:25,695 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 09:39:25,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:39:25,696 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:25,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 22 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 09:39:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-03 09:39:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-03 09:39:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-03 09:39:25,701 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2025-03-03 09:39:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:25,701 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-03 09:39:25,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-03 09:39:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-03 09:39:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:39:25,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:25,702 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:25,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:25,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:39:25,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:25,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash 509156976, now seen corresponding path program 7 times [2025-03-03 09:39:25,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:25,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909692299] [2025-03-03 09:39:25,903 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:39:25,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:25,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:39:25,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:39:25,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:25,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:26,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909692299] [2025-03-03 09:39:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909692299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769873475] [2025-03-03 09:39:26,798 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:39:26,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:26,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:26,799 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:26,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:39:26,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:39:26,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:39:26,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:26,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:26,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-03 09:39:26,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:26,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:39:26,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:27,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:27,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:39:27,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:27,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-03 09:39:27,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:27,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:27,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:27,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:27,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 125 [2025-03-03 09:39:27,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:27,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 11773 treesize of output 11191 [2025-03-03 09:39:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:27,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769873475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:27,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:27,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49 [2025-03-03 09:39:27,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834742445] [2025-03-03 09:39:27,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:27,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 09:39:27,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:27,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 09:39:27,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2055, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 09:39:27,974 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 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-03 09:39:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:28,906 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-03-03 09:39:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 09:39:28,906 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 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 25 [2025-03-03 09:39:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:28,906 INFO L225 Difference]: With dead ends: 61 [2025-03-03 09:39:28,906 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 09:39:28,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=447, Invalid=2859, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 09:39:28,907 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:28,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 107 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:39:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 09:39:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2025-03-03 09:39:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-03 09:39:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-03 09:39:28,916 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-03 09:39:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:28,916 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-03 09:39:28,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 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-03 09:39:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-03 09:39:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:39:28,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:28,918 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:28,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 09:39:29,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:29,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:29,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:29,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1298297487, now seen corresponding path program 2 times [2025-03-03 09:39:29,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:29,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886895383] [2025-03-03 09:39:29,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:29,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:29,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-03 09:39:29,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:39:29,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:29,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:39:29,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886895383] [2025-03-03 09:39:29,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886895383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524399150] [2025-03-03 09:39:29,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:29,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:29,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:29,291 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:29,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:39:29,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-03 09:39:29,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:39:29,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:29,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:29,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 09:39:29,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:29,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:39:29,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:39:29,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:39:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:39:29,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:29,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-03 09:39:29,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:39:29,557 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:39:29,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524399150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:29,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:29,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-03 09:39:29,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873174210] [2025-03-03 09:39:29,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:29,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:39:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:29,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:39:29,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:39:29,558 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 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-03 09:39:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:29,639 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-03-03 09:39:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:39:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 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 25 [2025-03-03 09:39:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:29,640 INFO L225 Difference]: With dead ends: 51 [2025-03-03 09:39:29,640 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 09:39:29,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:39:29,640 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:29,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 72 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 09:39:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-03 09:39:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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-03 09:39:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-03 09:39:29,648 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2025-03-03 09:39:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:29,648 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-03 09:39:29,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 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-03 09:39:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-03 09:39:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:39:29,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:29,648 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:29,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:39:29,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:39:29,849 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:29,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2031421524, now seen corresponding path program 8 times [2025-03-03 09:39:29,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:29,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672653895] [2025-03-03 09:39:29,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:29,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-03 09:39:29,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:39:29,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:29,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:39:29,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:29,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672653895] [2025-03-03 09:39:29,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672653895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137879016] [2025-03-03 09:39:29,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:29,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:29,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:29,957 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:29,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:39:30,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-03 09:39:30,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:39:30,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:30,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:30,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:39:30,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:39:30,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:39:30,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137879016] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:30,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:30,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-03 09:39:30,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352512363] [2025-03-03 09:39:30,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:30,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:39:30,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:30,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:39:30,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:39:30,162 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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-03 09:39:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:30,322 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-03-03 09:39:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:39:30,323 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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 26 [2025-03-03 09:39:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:30,324 INFO L225 Difference]: With dead ends: 53 [2025-03-03 09:39:30,324 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 09:39:30,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:39:30,325 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:30,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 24 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 09:39:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-03 09:39:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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-03 09:39:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-03 09:39:30,338 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2025-03-03 09:39:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:30,338 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-03 09:39:30,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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-03 09:39:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-03 09:39:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:39:30,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:30,339 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:30,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:39:30,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:39:30,542 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:30,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash -433563119, now seen corresponding path program 3 times [2025-03-03 09:39:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:30,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860292599] [2025-03-03 09:39:30,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:30,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-03-03 09:39:30,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 29 statements. [2025-03-03 09:39:30,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:39:30,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:30,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:30,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860292599] [2025-03-03 09:39:30,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860292599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:30,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674228668] [2025-03-03 09:39:30,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:30,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:30,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:30,653 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:30,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:39:30,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-03-03 09:39:30,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 29 statements. [2025-03-03 09:39:30,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:39:30,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:30,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:39:30,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:30,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:30,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674228668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:30,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:30,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-03 09:39:30,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78489760] [2025-03-03 09:39:30,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:30,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:39:30,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:30,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:39:30,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:39:30,846 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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-03 09:39:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:30,923 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-03-03 09:39:30,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:39:30,923 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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 29 [2025-03-03 09:39:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:30,924 INFO L225 Difference]: With dead ends: 57 [2025-03-03 09:39:30,924 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 09:39:30,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:39:30,924 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:30,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 23 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 09:39:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-03 09:39:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 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-03 09:39:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-03-03 09:39:30,934 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2025-03-03 09:39:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:30,934 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-03-03 09:39:30,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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-03 09:39:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-03-03 09:39:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:39:30,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:30,936 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:30,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:31,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:39:31,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:31,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1460355286, now seen corresponding path program 9 times [2025-03-03 09:39:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563297614] [2025-03-03 09:39:31,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:31,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:31,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-03-03 09:39:31,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:39:31,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:39:31,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:32,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:32,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563297614] [2025-03-03 09:39:32,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563297614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:32,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150386781] [2025-03-03 09:39:32,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:32,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:32,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:32,625 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:32,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:39:32,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-03-03 09:39:32,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:39:32,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:39:32,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:32,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-03 09:39:32,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:32,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:39:32,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:32,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:32,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:39:33,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:33,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-03 09:39:33,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:33,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-03-03 09:39:33,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:33,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:33,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:33,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:39:33,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:34,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 198 [2025-03-03 09:39:34,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:34,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1403422 treesize of output 1346191 [2025-03-03 09:39:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:39:34,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150386781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:34,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:34,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 64 [2025-03-03 09:39:34,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351607748] [2025-03-03 09:39:34,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:34,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-03 09:39:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:34,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-03 09:39:34,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3624, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 09:39:34,861 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 64 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 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-03 09:39:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:37,316 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2025-03-03 09:39:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-03 09:39:37,317 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 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 30 [2025-03-03 09:39:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:37,317 INFO L225 Difference]: With dead ends: 86 [2025-03-03 09:39:37,317 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 09:39:37,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1187, Invalid=8913, Unknown=0, NotChecked=0, Total=10100 [2025-03-03 09:39:37,320 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 116 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:37,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:39:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 09:39:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2025-03-03 09:39:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 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-03 09:39:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-03-03 09:39:37,334 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 30 [2025-03-03 09:39:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:37,334 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-03-03 09:39:37,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 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-03 09:39:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-03-03 09:39:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:39:37,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:37,335 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:37,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:39:37,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:39:37,536 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:37,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1263841781, now seen corresponding path program 4 times [2025-03-03 09:39:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:37,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370110940] [2025-03-03 09:39:37,536 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:39:37,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:37,542 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-03 09:39:37,553 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 30 statements. [2025-03-03 09:39:37,553 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:39:37,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 09:39:37,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:37,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370110940] [2025-03-03 09:39:37,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370110940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598112203] [2025-03-03 09:39:37,745 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:39:37,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:37,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:37,747 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:37,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:39:37,810 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-03 09:39:37,823 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 30 statements. [2025-03-03 09:39:37,823 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:39:37,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:37,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 09:39:37,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:37,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-03 09:39:37,894 INFO L349 Elim1Store]: treesize reduction 22, result has 42.1 percent of original size [2025-03-03 09:39:37,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-03 09:39:37,944 INFO L349 Elim1Store]: treesize reduction 24, result has 40.0 percent of original size [2025-03-03 09:39:37,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 24 [2025-03-03 09:39:38,011 INFO L349 Elim1Store]: treesize reduction 24, result has 40.0 percent of original size [2025-03-03 09:39:38,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2025-03-03 09:39:38,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 09:39:38,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 12 [2025-03-03 09:39:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:39:38,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:39:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598112203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:38,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:38,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 24 [2025-03-03 09:39:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129007055] [2025-03-03 09:39:38,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:38,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:39:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:38,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:39:38,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:39:38,243 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 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-03 09:39:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:38,778 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2025-03-03 09:39:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 09:39:38,779 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 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 30 [2025-03-03 09:39:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:38,779 INFO L225 Difference]: With dead ends: 82 [2025-03-03 09:39:38,779 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 09:39:38,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=1333, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 09:39:38,780 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:38,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 49 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:39:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 09:39:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2025-03-03 09:39:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 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-03 09:39:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-03-03 09:39:38,792 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 30 [2025-03-03 09:39:38,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:38,792 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-03-03 09:39:38,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 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-03 09:39:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-03-03 09:39:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 09:39:38,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:38,793 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:38,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 09:39:38,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:38,997 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:38,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash -285342219, now seen corresponding path program 10 times [2025-03-03 09:39:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:38,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596762341] [2025-03-03 09:39:38,997 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:39:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:39,004 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-03 09:39:39,008 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 34 statements. [2025-03-03 09:39:39,008 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:39:39,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:39:39,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:39,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596762341] [2025-03-03 09:39:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596762341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:39,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838492964] [2025-03-03 09:39:39,094 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:39:39,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:39,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:39,096 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:39,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:39:39,149 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-03 09:39:39,160 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 34 statements. [2025-03-03 09:39:39,160 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:39:39,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:39,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:39:39,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:39:39,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:39:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838492964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:39,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:39,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-03 09:39:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162655503] [2025-03-03 09:39:39,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:39,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:39:39,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:39,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:39:39,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:39:39,275 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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-03 09:39:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:39,456 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2025-03-03 09:39:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:39:39,457 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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 34 [2025-03-03 09:39:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:39,457 INFO L225 Difference]: With dead ends: 68 [2025-03-03 09:39:39,458 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 09:39:39,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2025-03-03 09:39:39,458 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 58 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:39,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 25 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 09:39:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-03-03 09:39:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 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-03 09:39:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-03-03 09:39:39,470 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 34 [2025-03-03 09:39:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:39,471 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-03-03 09:39:39,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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-03 09:39:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-03-03 09:39:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:39:39,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:39,472 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:39,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:39,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 09:39:39,673 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:39,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash -255642448, now seen corresponding path program 11 times [2025-03-03 09:39:39,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:39,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092492459] [2025-03-03 09:39:39,673 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:39:39,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:39,680 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-03 09:39:39,714 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:39:39,715 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:39:39,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:39:40,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092492459] [2025-03-03 09:39:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092492459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740202615] [2025-03-03 09:39:40,866 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:39:40,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:40,868 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:40,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 09:39:40,924 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-03 09:39:40,998 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:39:40,998 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:39:40,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:41,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-03 09:39:41,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:41,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:39:41,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:41,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:41,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:39:41,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:41,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-03 09:39:41,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:41,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-03-03 09:39:41,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:41,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 51 [2025-03-03 09:39:41,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:41,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:41,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:41,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:42,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:39:42,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:43,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 281 [2025-03-03 09:39:43,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:43,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 610612925 treesize of output 591738743 [2025-03-03 09:39:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:39:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740202615] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:44,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 25] total 70 [2025-03-03 09:39:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638624889] [2025-03-03 09:39:44,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:44,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-03-03 09:39:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:44,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-03-03 09:39:44,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=4410, Unknown=0, NotChecked=0, Total=4830 [2025-03-03 09:39:44,434 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 70 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 70 states have internal predecessors, (81), 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-03 09:39:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:46,380 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2025-03-03 09:39:46,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 09:39:46,381 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 70 states have internal predecessors, (81), 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 35 [2025-03-03 09:39:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:46,382 INFO L225 Difference]: With dead ends: 81 [2025-03-03 09:39:46,382 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 09:39:46,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2161 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=830, Invalid=7542, Unknown=0, NotChecked=0, Total=8372 [2025-03-03 09:39:46,383 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:46,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 175 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:39:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 09:39:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2025-03-03 09:39:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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-03 09:39:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2025-03-03 09:39:46,401 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 35 [2025-03-03 09:39:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:46,401 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-03-03 09:39:46,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 70 states have internal predecessors, (81), 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-03 09:39:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2025-03-03 09:39:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:39:46,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:46,401 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:46,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:46,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:39:46,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:46,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:46,602 INFO L85 PathProgramCache]: Analyzing trace with hash -761201073, now seen corresponding path program 5 times [2025-03-03 09:39:46,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:46,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654101732] [2025-03-03 09:39:46,602 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:39:46,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:46,611 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-03 09:39:46,626 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:39:46,626 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:39:46,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:39:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654101732] [2025-03-03 09:39:46,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654101732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554316927] [2025-03-03 09:39:46,855 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:39:46,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:46,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:46,857 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:46,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:39:46,919 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-03 09:39:47,095 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:39:47,096 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:39:47,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:47,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 09:39:47,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:47,107 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 13 treesize of output 9 [2025-03-03 09:39:47,129 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-03-03 09:39:47,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-03-03 09:39:47,197 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-03 09:39:47,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2025-03-03 09:39:47,254 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2025-03-03 09:39:47,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 27 [2025-03-03 09:39:47,300 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2025-03-03 09:39:47,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 27 [2025-03-03 09:39:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:39:47,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:47,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-03 09:39:47,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-03-03 09:39:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:39:47,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554316927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:47,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:47,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2025-03-03 09:39:47,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846691579] [2025-03-03 09:39:47,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:47,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:39:47,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:47,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:39:47,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:39:47,359 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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-03 09:39:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:47,697 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2025-03-03 09:39:47,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:39:47,697 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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 35 [2025-03-03 09:39:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:47,698 INFO L225 Difference]: With dead ends: 84 [2025-03-03 09:39:47,698 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 09:39:47,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:39:47,699 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:47,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 70 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:39:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 09:39:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2025-03-03 09:39:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 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-03 09:39:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2025-03-03 09:39:47,717 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 35 [2025-03-03 09:39:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:47,717 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2025-03-03 09:39:47,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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-03 09:39:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2025-03-03 09:39:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 09:39:47,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:47,717 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:47,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-03 09:39:47,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:47,918 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:47,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:47,918 INFO L85 PathProgramCache]: Analyzing trace with hash 665050453, now seen corresponding path program 12 times [2025-03-03 09:39:47,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:47,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864704403] [2025-03-03 09:39:47,919 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:39:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:47,925 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 6 equivalence classes. [2025-03-03 09:39:47,935 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:39:47,936 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 09:39:47,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 09:39:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864704403] [2025-03-03 09:39:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864704403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198845585] [2025-03-03 09:39:48,078 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:39:48,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:48,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:48,081 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:48,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 09:39:48,163 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 6 equivalence classes. [2025-03-03 09:39:48,214 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:39:48,214 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 09:39:48,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:48,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:39:48,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:48,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198845585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:48,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 27 [2025-03-03 09:39:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945075233] [2025-03-03 09:39:48,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:48,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 09:39:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:48,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 09:39:48,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:39:48,405 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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-03 09:39:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:48,664 INFO L93 Difference]: Finished difference Result 127 states and 145 transitions. [2025-03-03 09:39:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 09:39:48,665 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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 36 [2025-03-03 09:39:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:48,665 INFO L225 Difference]: With dead ends: 127 [2025-03-03 09:39:48,665 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 09:39:48,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 49 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=1542, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 09:39:48,666 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 133 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:48,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 32 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 09:39:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2025-03-03 09:39:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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-03 09:39:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-03-03 09:39:48,679 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 36 [2025-03-03 09:39:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:48,679 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-03-03 09:39:48,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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-03 09:39:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-03-03 09:39:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:39:48,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:48,679 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:48,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-03 09:39:48,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:48,880 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:48,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1032416750, now seen corresponding path program 6 times [2025-03-03 09:39:48,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:48,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914251141] [2025-03-03 09:39:48,880 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:39:48,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:48,887 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 7 equivalence classes. [2025-03-03 09:39:48,910 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:39:48,911 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:39:48,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 22 proven. 44 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:39:49,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:49,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914251141] [2025-03-03 09:39:49,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914251141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:49,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552357854] [2025-03-03 09:39:49,062 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:39:49,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:49,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:49,064 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:49,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 09:39:49,127 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 7 equivalence classes. [2025-03-03 09:39:49,264 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:39:49,264 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:39:49,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:49,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:39:49,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 09:39:49,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 09:39:49,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552357854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:49,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:49,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-03-03 09:39:49,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263526792] [2025-03-03 09:39:49,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:49,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:39:49,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:49,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:39:49,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:39:49,423 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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-03 09:39:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:49,548 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2025-03-03 09:39:49,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:39:49,549 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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 39 [2025-03-03 09:39:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:49,549 INFO L225 Difference]: With dead ends: 62 [2025-03-03 09:39:49,549 INFO L226 Difference]: Without dead ends: 59 [2025-03-03 09:39:49,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:39:49,550 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:49,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 26 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-03 09:39:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2025-03-03 09:39:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 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-03 09:39:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-03 09:39:49,568 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 39 [2025-03-03 09:39:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:49,568 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-03 09:39:49,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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-03 09:39:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-03 09:39:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:39:49,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:49,569 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:49,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-03 09:39:49,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:49,769 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash 432628118, now seen corresponding path program 13 times [2025-03-03 09:39:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:49,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865363817] [2025-03-03 09:39:49,770 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:39:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:49,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:39:49,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:39:49,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:49,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865363817] [2025-03-03 09:39:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865363817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754332071] [2025-03-03 09:39:51,821 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:39:51,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:51,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:51,822 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:51,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 09:39:51,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:39:51,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:39:51,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:51,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:51,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-03 09:39:51,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:51,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:39:52,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:52,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:52,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:39:52,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:52,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-03 09:39:52,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:52,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-03-03 09:39:52,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:52,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 51 [2025-03-03 09:39:53,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:53,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2025-03-03 09:39:53,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:53,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:53,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:53,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:53,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:53,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:39:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:53,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:55,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 410 treesize of output 386 [2025-03-03 09:39:55,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:55,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 1720269633606 treesize of output 1696647313755 [2025-03-03 09:39:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754332071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:57,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:57,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 93 [2025-03-03 09:39:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422983055] [2025-03-03 09:39:57,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:57,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-03-03 09:39:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:57,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-03-03 09:39:57,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=7930, Unknown=0, NotChecked=0, Total=8556 [2025-03-03 09:39:57,621 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 93 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 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-03 09:39:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:59,863 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2025-03-03 09:39:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 09:39:59,863 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 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 40 [2025-03-03 09:39:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:59,864 INFO L225 Difference]: With dead ends: 90 [2025-03-03 09:39:59,864 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 09:39:59,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=793, Invalid=9307, Unknown=0, NotChecked=0, Total=10100 [2025-03-03 09:39:59,865 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:59,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 189 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2112 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 09:39:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 09:39:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2025-03-03 09:39:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 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-03 09:39:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2025-03-03 09:39:59,880 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 40 [2025-03-03 09:39:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:59,880 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2025-03-03 09:39:59,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 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-03 09:39:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2025-03-03 09:39:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:39:59,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:59,881 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:59,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-03 09:40:00,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 09:40:00,082 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:00,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1940179927, now seen corresponding path program 7 times [2025-03-03 09:40:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:00,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668960865] [2025-03-03 09:40:00,083 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:40:00,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:00,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:40:00,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:40:00,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:00,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 10 proven. 62 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:40:00,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668960865] [2025-03-03 09:40:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668960865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084626078] [2025-03-03 09:40:00,431 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:40:00,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:00,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:00,433 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:00,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 09:40:00,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:40:00,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:40:00,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:00,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:00,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-03 09:40:00,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:00,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:40:00,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:40:00,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:00,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:40:00,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:00,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:40:00,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:00,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:40:00,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:00,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:40:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 47 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 09:40:00,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:00,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-03-03 09:40:00,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-03-03 09:40:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 24 proven. 46 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 09:40:01,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084626078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:01,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:01,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 44 [2025-03-03 09:40:01,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660718626] [2025-03-03 09:40:01,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:01,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 09:40:01,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:01,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 09:40:01,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1656, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 09:40:01,059 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 44 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 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-03 09:40:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:01,483 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2025-03-03 09:40:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 09:40:01,483 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 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 40 [2025-03-03 09:40:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:01,484 INFO L225 Difference]: With dead ends: 80 [2025-03-03 09:40:01,484 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 09:40:01,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=462, Invalid=2960, Unknown=0, NotChecked=0, Total=3422 [2025-03-03 09:40:01,485 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:01,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 89 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:40:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 09:40:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-03 09:40:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.09375) internal successors, (70), 64 states have internal predecessors, (70), 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-03 09:40:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2025-03-03 09:40:01,513 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 40 [2025-03-03 09:40:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:01,513 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2025-03-03 09:40:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 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-03 09:40:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2025-03-03 09:40:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:40:01,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:01,513 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:01,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:01,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 09:40:01,714 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:01,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash 981988146, now seen corresponding path program 14 times [2025-03-03 09:40:01,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:01,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986606638] [2025-03-03 09:40:01,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:01,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:01,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 09:40:01,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:40:01,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:01,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:40:01,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986606638] [2025-03-03 09:40:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986606638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380949799] [2025-03-03 09:40:01,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:01,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:01,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:01,885 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:01,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 09:40:01,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 09:40:01,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:40:01,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:01,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:01,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:40:01,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:40:02,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:40:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380949799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:02,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:02,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2025-03-03 09:40:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265754881] [2025-03-03 09:40:02,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:02,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 09:40:02,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:02,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 09:40:02,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:40:02,252 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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-03 09:40:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:02,594 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2025-03-03 09:40:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 09:40:02,594 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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 41 [2025-03-03 09:40:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:02,595 INFO L225 Difference]: With dead ends: 83 [2025-03-03 09:40:02,595 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 09:40:02,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 09:40:02,595 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:02,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 48 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:40:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 09:40:02,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2025-03-03 09:40:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2025-03-03 09:40:02,614 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 41 [2025-03-03 09:40:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:02,614 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2025-03-03 09:40:02,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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-03 09:40:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2025-03-03 09:40:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 09:40:02,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:02,614 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:02,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:02,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:02,815 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:02,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 866163440, now seen corresponding path program 15 times [2025-03-03 09:40:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:02,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543911610] [2025-03-03 09:40:02,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:02,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:02,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 8 equivalence classes. [2025-03-03 09:40:02,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:40:02,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 09:40:02,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 3 proven. 120 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:40:05,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543911610] [2025-03-03 09:40:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543911610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669990834] [2025-03-03 09:40:05,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:05,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:05,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:05,472 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:05,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 09:40:05,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 8 equivalence classes. [2025-03-03 09:40:05,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:40:05,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 09:40:05,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:05,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-03-03 09:40:05,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:05,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:40:05,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:05,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:05,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:40:05,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:05,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-03 09:40:06,021 INFO L349 Elim1Store]: treesize reduction 60, result has 36.2 percent of original size [2025-03-03 09:40:06,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 55 [2025-03-03 09:40:06,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,222 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2025-03-03 09:40:06,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 55 treesize of output 61 [2025-03-03 09:40:06,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,468 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2025-03-03 09:40:06,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 66 treesize of output 75 [2025-03-03 09:40:06,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:06,766 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2025-03-03 09:40:06,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 89 [2025-03-03 09:40:07,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:07,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:07,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:07,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-03 09:40:07,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-03 09:40:07,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-03-03 09:40:07,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2025-03-03 09:40:07,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:07,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:07,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 94 treesize of output 114 [2025-03-03 09:40:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 23 proven. 88 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:40:08,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:10,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 247 [2025-03-03 09:40:10,288 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-03-03 09:40:10,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 11089 treesize of output 10467 [2025-03-03 09:40:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 09:40:10,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669990834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:10,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:10,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 34, 33] total 94 [2025-03-03 09:40:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231087675] [2025-03-03 09:40:10,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:10,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2025-03-03 09:40:10,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:10,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2025-03-03 09:40:10,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1143, Invalid=7599, Unknown=0, NotChecked=0, Total=8742 [2025-03-03 09:40:10,495 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 94 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 94 states have internal predecessors, (109), 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-03 09:40:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:20,822 INFO L93 Difference]: Finished difference Result 126 states and 147 transitions. [2025-03-03 09:40:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-03 09:40:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 94 states have internal predecessors, (109), 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 45 [2025-03-03 09:40:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:20,823 INFO L225 Difference]: With dead ends: 126 [2025-03-03 09:40:20,823 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 09:40:20,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8802 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=4035, Invalid=24357, Unknown=0, NotChecked=0, Total=28392 [2025-03-03 09:40:20,824 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 90 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:20,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 175 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 09:40:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 09:40:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2025-03-03 09:40:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 88 states have internal predecessors, (105), 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-03 09:40:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2025-03-03 09:40:20,860 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 45 [2025-03-03 09:40:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:20,860 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2025-03-03 09:40:20,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 94 states have internal predecessors, (109), 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-03 09:40:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2025-03-03 09:40:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 09:40:20,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:20,861 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:20,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-03 09:40:21,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:21,061 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:21,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:21,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1081294613, now seen corresponding path program 16 times [2025-03-03 09:40:21,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:21,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154922037] [2025-03-03 09:40:21,062 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:21,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:21,070 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-03 09:40:21,073 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 42 of 46 statements. [2025-03-03 09:40:21,073 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:40:21,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 36 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 09:40:21,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:21,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154922037] [2025-03-03 09:40:21,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154922037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:21,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497426315] [2025-03-03 09:40:21,190 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:21,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:21,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:21,192 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:21,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 09:40:21,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-03 09:40:21,287 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 42 of 46 statements. [2025-03-03 09:40:21,288 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:40:21,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:21,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:40:21,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 36 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 09:40:21,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 36 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 09:40:21,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497426315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:21,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:21,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 26 [2025-03-03 09:40:21,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225241151] [2025-03-03 09:40:21,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:21,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 09:40:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:21,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 09:40:21,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:40:21,507 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 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-03 09:40:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:21,811 INFO L93 Difference]: Finished difference Result 180 states and 217 transitions. [2025-03-03 09:40:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 09:40:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 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 46 [2025-03-03 09:40:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:21,812 INFO L225 Difference]: With dead ends: 180 [2025-03-03 09:40:21,812 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 09:40:21,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 15 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=412, Invalid=1228, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:40:21,813 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 92 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:21,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 27 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 09:40:21,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2025-03-03 09:40:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 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-03 09:40:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2025-03-03 09:40:21,851 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 46 [2025-03-03 09:40:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:21,851 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2025-03-03 09:40:21,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 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-03 09:40:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2025-03-03 09:40:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 09:40:21,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:21,852 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:21,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-03 09:40:22,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 09:40:22,053 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:22,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1640968790, now seen corresponding path program 17 times [2025-03-03 09:40:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:22,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789746333] [2025-03-03 09:40:22,054 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:22,061 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 9 equivalence classes. [2025-03-03 09:40:22,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:40:22,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-03 09:40:22,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 09:40:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789746333] [2025-03-03 09:40:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789746333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879657770] [2025-03-03 09:40:24,695 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:24,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:24,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:24,697 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:24,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-03 09:40:24,786 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 9 equivalence classes. [2025-03-03 09:40:33,228 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:40:33,229 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-03 09:40:33,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:33,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-03 09:40:33,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:33,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:40:33,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:33,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:33,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:40:33,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:33,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-03 09:40:33,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:33,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-03-03 09:40:33,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:33,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 51 [2025-03-03 09:40:33,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:33,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2025-03-03 09:40:34,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:34,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 71 [2025-03-03 09:40:34,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:34,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 81 [2025-03-03 09:40:34,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:34,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:34,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:34,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:34,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:35,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:35,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:35,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:40:35,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:39,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 674 treesize of output 642 [2025-03-03 09:40:41,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:41,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 2995501501543280730 treesize of output 833773680405443163