./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array23_pattern.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-patterns/array23_pattern.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 e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:29:20,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:29:20,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:29:20,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:29:20,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:29:20,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:29:20,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:29:20,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:29:20,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:29:20,104 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:29:20,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:29:20,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:29:20,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:29:20,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:29:20,106 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:29:20,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:29:20,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:29:20,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:29:20,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:29:20,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:29:20,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:29:20,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:29:20,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:29:20,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:29:20,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:29:20,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:29:20,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:29:20,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:29:20,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:29:20,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:29:20,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:29:20,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:29:20,108 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 -> e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 [2025-03-03 09:29:20,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:29:20,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:29:20,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:29:20,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:29:20,328 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:29:20,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array23_pattern.c [2025-03-03 09:29:21,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5630bb5a/4c5870c3c5f14051a1dffba31deb7222/FLAG892a79eb4 [2025-03-03 09:29:21,657 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:29:21,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array23_pattern.c [2025-03-03 09:29:21,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5630bb5a/4c5870c3c5f14051a1dffba31deb7222/FLAG892a79eb4 [2025-03-03 09:29:21,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5630bb5a/4c5870c3c5f14051a1dffba31deb7222 [2025-03-03 09:29:21,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:29:21,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:29:21,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:29:21,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:29:21,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:29:21,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:29:21" (1/1) ... [2025-03-03 09:29:21,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66273f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:21, skipping insertion in model container [2025-03-03 09:29:21,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:29:21" (1/1) ... [2025-03-03 09:29:21,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:29:22,090 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-patterns/array23_pattern.c[1347,1360] [2025-03-03 09:29:22,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:29:22,120 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:29:22,128 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-patterns/array23_pattern.c[1347,1360] [2025-03-03 09:29:22,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:29:22,152 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:29:22,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22 WrapperNode [2025-03-03 09:29:22,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:29:22,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:29:22,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:29:22,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:29:22,158 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:29:22" (1/1) ... [2025-03-03 09:29:22,162 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:29:22" (1/1) ... [2025-03-03 09:29:22,178 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-03-03 09:29:22,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:29:22,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:29:22,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:29:22,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:29:22,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (1/1) ... [2025-03-03 09:29:22,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (1/1) ... [2025-03-03 09:29:22,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (1/1) ... [2025-03-03 09:29:22,195 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-03 09:29:22,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (1/1) ... [2025-03-03 09:29:22,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (1/1) ... [2025-03-03 09:29:22,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (1/1) ... [2025-03-03 09:29:22,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (1/1) ... [2025-03-03 09:29:22,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (1/1) ... [2025-03-03 09:29:22,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (1/1) ... [2025-03-03 09:29:22,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:29:22,202 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:29:22,202 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:29:22,202 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:29:22,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (1/1) ... [2025-03-03 09:29:22,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:29:22,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:22,229 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:29:22,236 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:29:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure outerBoundaryPatternCheck [2025-03-03 09:29:22,249 INFO L138 BoogieDeclarations]: Found implementation of procedure outerBoundaryPatternCheck [2025-03-03 09:29:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:29:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 09:29:22,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 09:29:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:29:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:29:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:29:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:29:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:29:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:29:22,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:29:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:29:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:29:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:29:22,298 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:29:22,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:29:22,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-03-03 09:29:22,481 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-03 09:29:22,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:29:22,488 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:29:22,488 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:29:22,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:29:22 BoogieIcfgContainer [2025-03-03 09:29:22,488 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:29:22,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:29:22,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:29:22,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:29:22,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:29:21" (1/3) ... [2025-03-03 09:29:22,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4e5d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:29:22, skipping insertion in model container [2025-03-03 09:29:22,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:22" (2/3) ... [2025-03-03 09:29:22,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4e5d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:29:22, skipping insertion in model container [2025-03-03 09:29:22,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:29:22" (3/3) ... [2025-03-03 09:29:22,496 INFO L128 eAbstractionObserver]: Analyzing ICFG array23_pattern.c [2025-03-03 09:29:22,506 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:29:22,507 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array23_pattern.c that has 3 procedures, 36 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-03 09:29:22,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:29:22,549 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;@7ddd63bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:29:22,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:29:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 09:29:22,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:22,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:22,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:22,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1959484098, now seen corresponding path program 1 times [2025-03-03 09:29:22,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:22,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649696049] [2025-03-03 09:29:22,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:22,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:22,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 09:29:22,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 09:29:22,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:22,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:22,659 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:29:22,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:22,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649696049] [2025-03-03 09:29:22,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649696049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:22,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:22,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:29:22,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555647668] [2025-03-03 09:29:22,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:22,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:29:22,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:22,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:29:22,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:29:22,680 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 09:29:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:22,694 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2025-03-03 09:29:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:29:22,696 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-03 09:29:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:22,700 INFO L225 Difference]: With dead ends: 69 [2025-03-03 09:29:22,700 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 09:29:22,702 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:29:22,705 INFO L435 NwaCegarLoop]: 46 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, 46 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:29:22,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 09:29:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-03 09:29:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-03 09:29:22,731 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 14 [2025-03-03 09:29:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:22,732 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-03 09:29:22,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 09:29:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-03-03 09:29:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:29:22,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:22,734 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:22,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:29:22,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:22,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash -634911244, now seen corresponding path program 1 times [2025-03-03 09:29:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:22,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107444958] [2025-03-03 09:29:22,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:22,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:22,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 09:29:22,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:29:22,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:22,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:29:23,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:23,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107444958] [2025-03-03 09:29:23,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107444958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:23,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:23,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:23,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887595992] [2025-03-03 09:29:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:23,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:23,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:23,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:23,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:23,018 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:23,035 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-03-03 09:29:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:23,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-03-03 09:29:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:23,037 INFO L225 Difference]: With dead ends: 37 [2025-03-03 09:29:23,037 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 09:29:23,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:23,038 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:23,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 09:29:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-03 09:29:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-03 09:29:23,044 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 41 [2025-03-03 09:29:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:23,045 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-03 09:29:23,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-03 09:29:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:29:23,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:23,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:23,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:29:23,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:23,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:23,049 INFO L85 PathProgramCache]: Analyzing trace with hash 484814132, now seen corresponding path program 1 times [2025-03-03 09:29:23,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:23,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90956333] [2025-03-03 09:29:23,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:23,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:29:23,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:29:23,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:23,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:29:23,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:23,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90956333] [2025-03-03 09:29:23,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90956333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:23,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:23,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:29:23,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689309491] [2025-03-03 09:29:23,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:23,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:29:23,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:23,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:29:23,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:29:23,186 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:23,270 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2025-03-03 09:29:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:29:23,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-03 09:29:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:23,271 INFO L225 Difference]: With dead ends: 68 [2025-03-03 09:29:23,271 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 09:29:23,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:29:23,272 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:23,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 09:29:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-03-03 09:29:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-03-03 09:29:23,276 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 44 [2025-03-03 09:29:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:23,276 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-03-03 09:29:23,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-03-03 09:29:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 09:29:23,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:23,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:23,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:29:23,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:23,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:23,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1011701486, now seen corresponding path program 1 times [2025-03-03 09:29:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:23,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141314869] [2025-03-03 09:29:23,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:23,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 09:29:23,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:29:23,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:23,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:29:23,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:23,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141314869] [2025-03-03 09:29:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141314869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:23,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:23,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233649832] [2025-03-03 09:29:23,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:23,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:23,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:23,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:23,374 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:23,429 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-03-03 09:29:23,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:23,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2025-03-03 09:29:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:23,430 INFO L225 Difference]: With dead ends: 68 [2025-03-03 09:29:23,431 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 09:29:23,431 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:29:23,431 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:23,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 09:29:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-03 09:29:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2025-03-03 09:29:23,435 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 46 [2025-03-03 09:29:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:23,435 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-03-03 09:29:23,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2025-03-03 09:29:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 09:29:23,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:23,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:23,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:29:23,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:23,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash 808191946, now seen corresponding path program 1 times [2025-03-03 09:29:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:23,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117580093] [2025-03-03 09:29:23,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:23,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:29:23,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:29:23,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:23,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:29:23,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:23,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117580093] [2025-03-03 09:29:23,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117580093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:23,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862147655] [2025-03-03 09:29:23,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:23,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:23,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:23,606 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:29:23,606 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:29:23,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:29:23,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:29:23,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:23,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:23,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:29:23,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:29:23,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:29:23,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862147655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:23,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:23,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-03 09:29:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082548310] [2025-03-03 09:29:23,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:23,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:29:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:23,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:29:23,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:29:23,835 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 09:29:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:23,958 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2025-03-03 09:29:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:29:23,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 47 [2025-03-03 09:29:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:23,959 INFO L225 Difference]: With dead ends: 74 [2025-03-03 09:29:23,959 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 09:29:23,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:29:23,960 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:23,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 123 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 09:29:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-03-03 09:29:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-03 09:29:23,965 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 47 [2025-03-03 09:29:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:23,966 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-03 09:29:23,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 09:29:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-03 09:29:23,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:29:23,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:23,966 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:23,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:24,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:24,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:24,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:24,171 INFO L85 PathProgramCache]: Analyzing trace with hash 151000504, now seen corresponding path program 2 times [2025-03-03 09:29:24,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:24,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900397167] [2025-03-03 09:29:24,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:29:24,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:24,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-03 09:29:24,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:29:24,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:29:24,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:29:24,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:24,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900397167] [2025-03-03 09:29:24,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900397167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:24,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873384301] [2025-03-03 09:29:24,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:29:24,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:24,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:24,294 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:29:24,295 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:29:24,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-03 09:29:24,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:29:24,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:29:24,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:24,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:29:24,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:29:24,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 09:29:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873384301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:24,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-03 09:29:24,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899305067] [2025-03-03 09:29:24,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:24,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:29:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:24,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:29:24,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:29:24,497 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 09:29:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:24,645 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2025-03-03 09:29:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:29:24,646 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 49 [2025-03-03 09:29:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:24,646 INFO L225 Difference]: With dead ends: 85 [2025-03-03 09:29:24,646 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 09:29:24,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:29:24,647 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:24,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 137 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 09:29:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-03-03 09:29:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:29:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-03-03 09:29:24,652 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 49 [2025-03-03 09:29:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:24,653 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-03 09:29:24,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 09:29:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-03-03 09:29:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:24,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:24,654 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:24,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:29:24,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 09:29:24,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:24,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2019860860, now seen corresponding path program 3 times [2025-03-03 09:29:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675457248] [2025-03-03 09:29:24,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:29:24,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:24,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-03-03 09:29:24,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:24,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:29:24,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:29:24,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667347504] [2025-03-03 09:29:24,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:29:24,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:24,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:24,900 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:29:24,902 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:29:24,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-03-03 09:29:25,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:25,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:29:25,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:25,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-03-03 09:29:25,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:25,663 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:29:25,702 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:29:25,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:25,820 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 26 treesize of output 28 [2025-03-03 09:29:25,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:25,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 09:29:26,816 INFO L349 Elim1Store]: treesize reduction 208, result has 33.5 percent of original size [2025-03-03 09:29:26,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 74 treesize of output 142 [2025-03-03 09:29:27,567 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 148 treesize of output 126 [2025-03-03 09:29:27,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,622 INFO L349 Elim1Store]: treesize reduction 212, result has 0.5 percent of original size [2025-03-03 09:29:27,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 126 treesize of output 223 [2025-03-03 09:29:27,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:27,806 INFO L349 Elim1Store]: treesize reduction 144, result has 37.1 percent of original size [2025-03-03 09:29:27,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 137 treesize of output 171 [2025-03-03 09:29:28,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:28,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 149 treesize of output 69 [2025-03-03 09:29:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:29:29,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:35,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:35,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675457248] [2025-03-03 09:29:35,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:29:35,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667347504] [2025-03-03 09:29:35,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667347504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:35,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:29:35,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2025-03-03 09:29:35,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719090062] [2025-03-03 09:29:35,622 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:35,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 09:29:35,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:35,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 09:29:35,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2424, Unknown=1, NotChecked=0, Total=2756 [2025-03-03 09:29:35,626 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 09:29:36,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:36,909 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2025-03-03 09:29:36,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-03 09:29:36,909 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 57 [2025-03-03 09:29:36,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:36,911 INFO L225 Difference]: With dead ends: 142 [2025-03-03 09:29:36,911 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 09:29:36,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=388, Invalid=2917, Unknown=1, NotChecked=0, Total=3306 [2025-03-03 09:29:36,913 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:36,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 437 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:29:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 09:29:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2025-03-03 09:29:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-03 09:29:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2025-03-03 09:29:36,925 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 57 [2025-03-03 09:29:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:36,926 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2025-03-03 09:29:36,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 09:29:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2025-03-03 09:29:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:36,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:36,926 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:36,931 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:29:37,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:37,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:37,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash -767554627, now seen corresponding path program 1 times [2025-03-03 09:29:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457590057] [2025-03-03 09:29:37,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:37,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:37,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:37,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:37,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:37,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:37,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457590057] [2025-03-03 09:29:37,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457590057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:37,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:37,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:37,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052540427] [2025-03-03 09:29:37,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:37,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:37,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:37,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:37,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:37,200 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 09:29:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:37,220 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2025-03-03 09:29:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:37,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2025-03-03 09:29:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:37,222 INFO L225 Difference]: With dead ends: 130 [2025-03-03 09:29:37,222 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 09:29:37,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:37,223 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:37,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 09:29:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-03 09:29:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2025-03-03 09:29:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2025-03-03 09:29:37,234 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 57 [2025-03-03 09:29:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:37,234 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2025-03-03 09:29:37,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 09:29:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2025-03-03 09:29:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:37,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:37,235 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:37,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:29:37,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:37,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1612026498, now seen corresponding path program 1 times [2025-03-03 09:29:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:37,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448115282] [2025-03-03 09:29:37,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:37,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:37,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:37,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:37,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:37,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:37,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448115282] [2025-03-03 09:29:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448115282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002570977] [2025-03-03 09:29:37,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:37,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:37,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:37,404 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:29:37,407 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:29:37,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:37,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:37,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:37,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:37,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:29:37,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 09:29:37,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 09:29:37,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002570977] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:37,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:37,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 15 [2025-03-03 09:29:37,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301955708] [2025-03-03 09:29:37,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:37,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:29:37,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:37,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:29:37,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:29:37,735 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 09:29:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:37,911 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2025-03-03 09:29:37,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:29:37,911 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 57 [2025-03-03 09:29:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:37,912 INFO L225 Difference]: With dead ends: 151 [2025-03-03 09:29:37,912 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 09:29:37,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:29:37,914 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:37,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 195 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 09:29:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-03-03 09:29:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 09:29:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2025-03-03 09:29:37,926 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 57 [2025-03-03 09:29:37,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:37,926 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2025-03-03 09:29:37,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 09:29:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2025-03-03 09:29:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:37,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:37,928 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:37,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:29:38,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:38,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:38,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1030341955, now seen corresponding path program 1 times [2025-03-03 09:29:38,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:38,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588904922] [2025-03-03 09:29:38,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:38,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:38,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:38,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:38,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:38,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:38,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:38,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588904922] [2025-03-03 09:29:38,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588904922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:38,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286746195] [2025-03-03 09:29:38,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:38,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:38,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:38,195 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:29:38,202 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:29:38,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:38,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:38,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:38,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:38,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:29:38,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 09:29:38,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:29:38,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286746195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:38,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:29:38,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:29:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011865122] [2025-03-03 09:29:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:38,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:38,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:38,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:29:38,276 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:38,294 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2025-03-03 09:29:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-03-03 09:29:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:38,295 INFO L225 Difference]: With dead ends: 142 [2025-03-03 09:29:38,295 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 09:29:38,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:29:38,295 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:38,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 09:29:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-03 09:29:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.1875) internal successors, (95), 80 states have internal predecessors, (95), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 09:29:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2025-03-03 09:29:38,310 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 57 [2025-03-03 09:29:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:38,311 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2025-03-03 09:29:38,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2025-03-03 09:29:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:38,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:38,313 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:38,319 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:29:38,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:29:38,514 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:38,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1313492419, now seen corresponding path program 1 times [2025-03-03 09:29:38,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:38,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784010367] [2025-03-03 09:29:38,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:38,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:38,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:38,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:38,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:38,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:38,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:38,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784010367] [2025-03-03 09:29:38,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784010367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:38,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054109860] [2025-03-03 09:29:38,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:38,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:38,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:38,567 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:29:38,568 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:29:38,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:38,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:38,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:38,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:38,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 09:29:38,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 09:29:38,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:29:38,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054109860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:38,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:29:38,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-03 09:29:38,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885125554] [2025-03-03 09:29:38,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:38,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:38,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:38,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:38,639 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:38,654 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2025-03-03 09:29:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:38,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-03-03 09:29:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:38,656 INFO L225 Difference]: With dead ends: 142 [2025-03-03 09:29:38,656 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 09:29:38,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:38,656 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:38,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:38,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 09:29:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-03 09:29:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 09:29:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2025-03-03 09:29:38,671 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 57 [2025-03-03 09:29:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:38,671 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2025-03-03 09:29:38,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:29:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2025-03-03 09:29:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:38,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:38,672 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:38,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:29:38,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:38,877 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash -68727938, now seen corresponding path program 1 times [2025-03-03 09:29:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:38,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975400695] [2025-03-03 09:29:38,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:38,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:38,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:38,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:38,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 09:29:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:39,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975400695] [2025-03-03 09:29:39,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975400695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:39,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298336655] [2025-03-03 09:29:39,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:39,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:39,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:39,139 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:29:39,140 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:29:39,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:39,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:39,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:39,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:39,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:29:39,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 09:29:39,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 09:29:39,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298336655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:39,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:39,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 20 [2025-03-03 09:29:39,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994071346] [2025-03-03 09:29:39,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:39,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:29:39,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:39,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:29:39,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:29:39,459 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 6 states have call successors, (13), 2 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 09:29:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:39,762 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2025-03-03 09:29:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:29:39,763 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 6 states have call successors, (13), 2 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 57 [2025-03-03 09:29:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:39,763 INFO L225 Difference]: With dead ends: 200 [2025-03-03 09:29:39,763 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 09:29:39,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:29:39,764 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:39,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 263 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:29:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 09:29:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 101. [2025-03-03 09:29:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.170731707317073) internal successors, (96), 81 states have internal predecessors, (96), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-03 09:29:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2025-03-03 09:29:39,774 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 57 [2025-03-03 09:29:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:39,774 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2025-03-03 09:29:39,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 6 states have call successors, (13), 2 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 09:29:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2025-03-03 09:29:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:39,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:39,775 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:39,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 09:29:39,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:39,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:39,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash -913199809, now seen corresponding path program 1 times [2025-03-03 09:29:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449100441] [2025-03-03 09:29:39,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:39,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:39,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:39,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:39,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:29:40,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:40,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449100441] [2025-03-03 09:29:40,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449100441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:29:40,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:29:40,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:29:40,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510606111] [2025-03-03 09:29:40,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:29:40,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:29:40,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:40,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:29:40,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:40,021 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 09:29:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:40,052 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2025-03-03 09:29:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:29:40,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2025-03-03 09:29:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:40,053 INFO L225 Difference]: With dead ends: 146 [2025-03-03 09:29:40,053 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 09:29:40,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:29:40,055 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:40,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:29:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 09:29:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-03 09:29:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 81 states have internal predecessors, (95), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-03 09:29:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2025-03-03 09:29:40,074 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 57 [2025-03-03 09:29:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:40,075 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2025-03-03 09:29:40,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 09:29:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2025-03-03 09:29:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:29:40,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:40,076 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:40,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:29:40,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:40,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:40,076 INFO L85 PathProgramCache]: Analyzing trace with hash 594352000, now seen corresponding path program 1 times [2025-03-03 09:29:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:40,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039521618] [2025-03-03 09:29:40,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:40,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:40,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:40,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:40,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 09:29:40,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:40,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039521618] [2025-03-03 09:29:40,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039521618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:40,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548886979] [2025-03-03 09:29:40,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:29:40,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:40,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:40,268 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:29:40,270 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:29:40,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:29:40,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:29:40,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:40,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:40,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:29:40,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 09:29:40,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 09:29:40,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548886979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:40,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:40,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 22 [2025-03-03 09:29:40,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286887105] [2025-03-03 09:29:40,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:40,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 09:29:40,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:40,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 09:29:40,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:29:40,679 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 09:29:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:40,961 INFO L93 Difference]: Finished difference Result 206 states and 241 transitions. [2025-03-03 09:29:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 09:29:40,962 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 57 [2025-03-03 09:29:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:40,963 INFO L225 Difference]: With dead ends: 206 [2025-03-03 09:29:40,963 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 09:29:40,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:29:40,964 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:40,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 202 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:29:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 09:29:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2025-03-03 09:29:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.161904761904762) internal successors, (122), 104 states have internal predecessors, (122), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-03-03 09:29:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2025-03-03 09:29:40,976 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 57 [2025-03-03 09:29:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:40,976 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2025-03-03 09:29:40,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 09:29:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2025-03-03 09:29:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 09:29:40,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:40,977 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:40,983 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:29:41,181 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,SelfDestructingSolverStorable13 [2025-03-03 09:29:41,181 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:41,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:41,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1807867506, now seen corresponding path program 4 times [2025-03-03 09:29:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:41,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741123434] [2025-03-03 09:29:41,182 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:29:41,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:41,189 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-03 09:29:41,192 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-03-03 09:29:41,193 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:29:41,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:29:41,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:41,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741123434] [2025-03-03 09:29:41,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741123434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:41,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442384870] [2025-03-03 09:29:41,261 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:29:41,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:41,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:41,263 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:29:41,265 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:29:41,306 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-03 09:29:41,319 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-03-03 09:29:41,319 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:29:41,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:41,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:29:41,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:29:41,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:29:41,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442384870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:41,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:41,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:29:41,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174839505] [2025-03-03 09:29:41,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:41,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:29:41,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:41,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:29:41,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:29:41,482 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:41,607 INFO L93 Difference]: Finished difference Result 218 states and 255 transitions. [2025-03-03 09:29:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:29:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-03-03 09:29:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:41,609 INFO L225 Difference]: With dead ends: 218 [2025-03-03 09:29:41,609 INFO L226 Difference]: Without dead ends: 139 [2025-03-03 09:29:41,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 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:29:41,609 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:41,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-03 09:29:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-03-03 09:29:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 110 states have (on average 1.1454545454545455) internal successors, (126), 109 states have internal predecessors, (126), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-03-03 09:29:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2025-03-03 09:29:41,623 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 58 [2025-03-03 09:29:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:41,623 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2025-03-03 09:29:41,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2025-03-03 09:29:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 09:29:41,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:41,624 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:41,630 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:29:41,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:29:41,825 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:41,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2025021380, now seen corresponding path program 5 times [2025-03-03 09:29:41,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:41,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43205850] [2025-03-03 09:29:41,825 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:29:41,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:41,831 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 7 equivalence classes. [2025-03-03 09:29:41,834 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 13 of 58 statements. [2025-03-03 09:29:41,834 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:29:41,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 09:29:41,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43205850] [2025-03-03 09:29:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43205850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448772617] [2025-03-03 09:29:41,892 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:29:41,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:41,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:41,894 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:29:41,896 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:29:41,940 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 7 equivalence classes. [2025-03-03 09:29:41,950 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 13 of 58 statements. [2025-03-03 09:29:41,950 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:29:41,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:41,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:29:41,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 09:29:41,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 09:29:42,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448772617] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:42,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:42,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-03 09:29:42,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820138077] [2025-03-03 09:29:42,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:42,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:29:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:42,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:29:42,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:29:42,037 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:42,151 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2025-03-03 09:29:42,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:29:42,152 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-03-03 09:29:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:42,152 INFO L225 Difference]: With dead ends: 172 [2025-03-03 09:29:42,152 INFO L226 Difference]: Without dead ends: 128 [2025-03-03 09:29:42,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:29:42,153 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:42,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 230 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-03 09:29:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2025-03-03 09:29:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.108910891089109) internal successors, (112), 99 states have internal predecessors, (112), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-03-03 09:29:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2025-03-03 09:29:42,166 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 58 [2025-03-03 09:29:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:42,166 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2025-03-03 09:29:42,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2025-03-03 09:29:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 09:29:42,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:42,166 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:42,172 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:29:42,367 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,SelfDestructingSolverStorable15 [2025-03-03 09:29:42,367 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:42,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:42,367 INFO L85 PathProgramCache]: Analyzing trace with hash 416378932, now seen corresponding path program 6 times [2025-03-03 09:29:42,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:42,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666182552] [2025-03-03 09:29:42,367 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:29:42,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:42,374 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 8 equivalence classes. [2025-03-03 09:29:42,396 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:29:42,399 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-03 09:29:42,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 09:29:42,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:42,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666182552] [2025-03-03 09:29:42,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666182552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:42,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434389233] [2025-03-03 09:29:42,487 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:29:42,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:42,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:42,488 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:29:42,491 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:29:42,536 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 8 equivalence classes. [2025-03-03 09:29:42,930 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:29:42,930 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-03 09:29:42,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:42,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:29:42,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 29 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:29:43,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 09:29:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434389233] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:43,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:43,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:29:43,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640221030] [2025-03-03 09:29:43,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:43,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:29:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:43,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:29:43,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:29:43,141 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:43,354 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2025-03-03 09:29:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 09:29:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2025-03-03 09:29:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:43,355 INFO L225 Difference]: With dead ends: 140 [2025-03-03 09:29:43,355 INFO L226 Difference]: Without dead ends: 137 [2025-03-03 09:29:43,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2025-03-03 09:29:43,356 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:43,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 260 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-03 09:29:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2025-03-03 09:29:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.1132075471698113) internal successors, (118), 104 states have internal predecessors, (118), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-03-03 09:29:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2025-03-03 09:29:43,370 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 61 [2025-03-03 09:29:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:43,370 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2025-03-03 09:29:43,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2025-03-03 09:29:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 09:29:43,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:43,371 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:43,375 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:29:43,571 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,SelfDestructingSolverStorable16 [2025-03-03 09:29:43,575 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:43,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1306566452, now seen corresponding path program 7 times [2025-03-03 09:29:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234614606] [2025-03-03 09:29:43,575 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:29:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:43,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 09:29:43,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 09:29:43,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:43,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 09:29:43,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:29:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234614606] [2025-03-03 09:29:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234614606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:29:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705467181] [2025-03-03 09:29:43,691 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:29:43,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:43,693 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:29:43,695 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:29:43,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 09:29:43,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 09:29:43,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:29:43,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:43,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:29:43,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-03 09:29:43,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 09:29:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705467181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:29:43,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:29:43,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 09:29:43,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057248710] [2025-03-03 09:29:43,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:29:43,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:29:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:29:43,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:29:43,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:29:43,910 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:29:44,041 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2025-03-03 09:29:44,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:29:44,042 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-03-03 09:29:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:29:44,042 INFO L225 Difference]: With dead ends: 195 [2025-03-03 09:29:44,042 INFO L226 Difference]: Without dead ends: 143 [2025-03-03 09:29:44,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:29:44,043 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:29:44,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 212 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:29:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-03 09:29:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2025-03-03 09:29:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 111 states have (on average 1.117117117117117) internal successors, (124), 109 states have internal predecessors, (124), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-03-03 09:29:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2025-03-03 09:29:44,055 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 66 [2025-03-03 09:29:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:29:44,055 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2025-03-03 09:29:44,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:29:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2025-03-03 09:29:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 09:29:44,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:29:44,056 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:29:44,061 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:29:44,256 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,SelfDestructingSolverStorable17 [2025-03-03 09:29:44,256 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:29:44,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:29:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash -787902902, now seen corresponding path program 8 times [2025-03-03 09:29:44,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:29:44,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527473288] [2025-03-03 09:29:44,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:29:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:29:44,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-03 09:29:44,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:29:44,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:29:44,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:29:44,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632168325] [2025-03-03 09:29:44,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:29:44,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:29:44,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:29:44,294 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:29:44,296 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:29:44,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-03 09:29:44,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:29:44,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:29:44,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:29:44,857 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 165 conjuncts are in the unsatisfiable core [2025-03-03 09:29:44,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:29:44,906 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:29:44,936 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:29:44,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:44,962 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 26 treesize of output 28 [2025-03-03 09:29:45,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2025-03-03 09:29:45,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2025-03-03 09:29:45,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-03 09:29:45,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-03 09:29:45,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 77 treesize of output 94 [2025-03-03 09:29:45,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:45,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:45,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 88 treesize of output 108 [2025-03-03 09:29:46,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:46,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:29:47,005 INFO L349 Elim1Store]: treesize reduction 386, result has 32.6 percent of original size [2025-03-03 09:29:47,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 39 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 165 case distinctions, treesize of input 186 treesize of output 318 [2025-03-03 09:29:55,111 INFO L349 Elim1Store]: treesize reduction 320, result has 30.0 percent of original size [2025-03-03 09:29:55,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 1020 treesize of output 976 [2025-03-03 09:30:21,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,383 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:21,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:21,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:22,513 INFO L349 Elim1Store]: treesize reduction 691, result has 7.5 percent of original size [2025-03-03 09:30:22,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 16 select indices, 16 select index equivalence classes, 49 disjoint index pairs (out of 120 index pairs), introduced 15 new quantified variables, introduced 51 case distinctions, treesize of input 1016 treesize of output 1103 [2025-03-03 09:30:35,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,728 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:30:35,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:35,835 INFO L349 Elim1Store]: treesize reduction 143, result has 40.9 percent of original size [2025-03-03 09:30:35,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 32 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 147 [2025-03-03 09:31:01,312 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 2059 treesize of output 1901 [2025-03-03 09:31:01,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:01,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:01,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:01,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:01,331 INFO L190 IndexEqualityManager]: detected not equals via solver