./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s1if.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 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:48:30,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:48:30,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:48:30,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:48:30,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:48:30,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:48:30,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:48:30,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:48:30,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:48:30,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:48:30,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:48:30,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:48:30,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:48:30,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:48:30,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:48:30,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:48:30,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:48:30,086 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 -> 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb [2025-03-08 00:48:30,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:48:30,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:48:30,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:48:30,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:48:30,309 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:48:30,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1if.c [2025-03-08 00:48:31,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e7054de/348c03646a2e455189762b0bf8a8cfa8/FLAGd18c9d3e3 [2025-03-08 00:48:31,670 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:48:31,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1if.c [2025-03-08 00:48:31,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e7054de/348c03646a2e455189762b0bf8a8cfa8/FLAGd18c9d3e3 [2025-03-08 00:48:31,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e7054de/348c03646a2e455189762b0bf8a8cfa8 [2025-03-08 00:48:31,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:48:31,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:48:31,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:48:31,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:48:31,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:48:31,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eef1ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31, skipping insertion in model container [2025-03-08 00:48:31,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:48:31,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1if.c[587,600] [2025-03-08 00:48:31,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:48:31,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:48:31,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1if.c[587,600] [2025-03-08 00:48:31,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:48:31,851 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:48:31,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31 WrapperNode [2025-03-08 00:48:31,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:48:31,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:48:31,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:48:31,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:48:31,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,879 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-03-08 00:48:31,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:48:31,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:48:31,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:48:31,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:48:31,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,899 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 4, 6]. 37 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 1, 3]. [2025-03-08 00:48:31,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:48:31,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:48:31,916 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:48:31,917 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:48:31,917 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:48:31,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:31,942 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-08 00:48:31,945 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-08 00:48:31,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:48:31,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:48:31,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:48:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:48:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:48:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:48:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:48:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:48:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:48:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:48:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:48:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:48:31,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:48:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:48:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:48:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:48:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:48:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:48:32,033 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:48:32,036 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:48:32,154 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-08 00:48:32,158 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:48:32,159 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:48:32,165 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:48:32,165 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:48:32,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:48:32 BoogieIcfgContainer [2025-03-08 00:48:32,166 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:48:32,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:48:32,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:48:32,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:48:32,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:48:31" (1/3) ... [2025-03-08 00:48:32,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716e9cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:48:32, skipping insertion in model container [2025-03-08 00:48:32,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (2/3) ... [2025-03-08 00:48:32,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716e9cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:48:32, skipping insertion in model container [2025-03-08 00:48:32,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:48:32" (3/3) ... [2025-03-08 00:48:32,174 INFO L128 eAbstractionObserver]: Analyzing ICFG s1if.c [2025-03-08 00:48:32,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:48:32,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s1if.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:48:32,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:48:32,228 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;@36200d82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:48:32,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:48:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:48:32,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:32,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:32,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:32,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash -673256721, now seen corresponding path program 1 times [2025-03-08 00:48:32,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:32,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795384838] [2025-03-08 00:48:32,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:32,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:32,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:48:32,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:48:32,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:32,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:32,368 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-08 00:48:32,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:32,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795384838] [2025-03-08 00:48:32,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795384838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:48:32,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:48:32,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:48:32,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202478800] [2025-03-08 00:48:32,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:48:32,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:48:32,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:32,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:48:32,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:48:32,388 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:32,395 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-03-08 00:48:32,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:48:32,397 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:48:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:32,402 INFO L225 Difference]: With dead ends: 28 [2025-03-08 00:48:32,402 INFO L226 Difference]: Without dead ends: 12 [2025-03-08 00:48:32,405 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-08 00:48:32,407 INFO L435 NwaCegarLoop]: 19 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, 19 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-08 00:48:32,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:48:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-08 00:48:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-08 00:48:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-08 00:48:32,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2025-03-08 00:48:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:32,434 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-08 00:48:32,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-03-08 00:48:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:48:32,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:32,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:32,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:48:32,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:32,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash -644627570, now seen corresponding path program 1 times [2025-03-08 00:48:32,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:32,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366826988] [2025-03-08 00:48:32,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:32,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:48:32,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:48:32,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:32,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:32,579 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-08 00:48:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:32,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366826988] [2025-03-08 00:48:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366826988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:48:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:48:32,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:48:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254659167] [2025-03-08 00:48:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:48:32,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:48:32,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:32,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:48:32,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:48:32,583 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:32,620 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-03-08 00:48:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:48:32,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:48:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:32,621 INFO L225 Difference]: With dead ends: 22 [2025-03-08 00:48:32,621 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 00:48:32,621 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-08 00:48:32,622 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:32,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:48:32,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 00:48:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2025-03-08 00:48:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-03-08 00:48:32,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2025-03-08 00:48:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:32,627 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-08 00:48:32,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-03-08 00:48:32,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:48:32,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:32,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:32,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:48:32,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:32,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash 380854543, now seen corresponding path program 1 times [2025-03-08 00:48:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:32,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659786309] [2025-03-08 00:48:32,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:32,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:48:32,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:48:32,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:32,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:33,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659786309] [2025-03-08 00:48:33,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659786309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453377890] [2025-03-08 00:48:33,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:33,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:33,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:33,068 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-08 00:48:33,070 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-08 00:48:33,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:48:33,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:48:33,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:33,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:33,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 00:48:33,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:33,168 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-08 00:48:33,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:33,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:33,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453377890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:33,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:33,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 00:48:33,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722130461] [2025-03-08 00:48:33,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:33,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 00:48:33,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:33,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 00:48:33,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:48:33,401 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:33,599 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-03-08 00:48:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:48:33,599 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 00:48:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:33,600 INFO L225 Difference]: With dead ends: 26 [2025-03-08 00:48:33,600 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:48:33,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:48:33,603 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:33,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:48:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-03-08 00:48:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-08 00:48:33,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2025-03-08 00:48:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:33,608 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-08 00:48:33,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-08 00:48:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:48:33,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:33,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:33,616 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-08 00:48:33,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:33,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:33,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash 381778064, now seen corresponding path program 1 times [2025-03-08 00:48:33,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:33,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743305746] [2025-03-08 00:48:33,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:33,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:33,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:48:33,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:48:33,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:33,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:33,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743305746] [2025-03-08 00:48:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743305746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489527480] [2025-03-08 00:48:33,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:33,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:33,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:33,979 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-08 00:48:33,980 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-08 00:48:34,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:48:34,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:48:34,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:34,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:34,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:48:34,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:34,046 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-08 00:48:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:34,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:34,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-08 00:48:34,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-08 00:48:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489527480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:34,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 00:48:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829756359] [2025-03-08 00:48:34,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:34,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:48:34,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:34,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:48:34,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:48:34,091 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:34,128 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-03-08 00:48:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:48:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 00:48:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:34,129 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:48:34,129 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:48:34,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:48:34,130 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:34,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 38 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:48:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:48:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-08 00:48:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-08 00:48:34,133 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2025-03-08 00:48:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:34,134 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-08 00:48:34,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-08 00:48:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:48:34,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:34,134 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:34,140 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-08 00:48:34,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 00:48:34,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:34,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1610116533, now seen corresponding path program 2 times [2025-03-08 00:48:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:34,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172727049] [2025-03-08 00:48:34,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:48:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:34,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 00:48:34,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:48:34,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:48:34,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:34,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:34,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172727049] [2025-03-08 00:48:34,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172727049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122473371] [2025-03-08 00:48:34,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:48:34,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:34,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:34,412 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-08 00:48:34,413 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-08 00:48:34,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 00:48:34,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:48:34,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:48:34,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:34,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:48:34,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:34,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122473371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:34,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:34,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:48:34,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319155799] [2025-03-08 00:48:34,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:34,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:48:34,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:34,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:48:34,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:48:34,545 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:34,623 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-03-08 00:48:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:48:34,623 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 00:48:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:34,624 INFO L225 Difference]: With dead ends: 27 [2025-03-08 00:48:34,624 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:48:34,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:48:34,625 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:34,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 19 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:48:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:48:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2025-03-08 00:48:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-08 00:48:34,628 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2025-03-08 00:48:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:34,628 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-08 00:48:34,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-08 00:48:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:48:34,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:34,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:34,634 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-08 00:48:34,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:34,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:34,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1147567788, now seen corresponding path program 3 times [2025-03-08 00:48:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:34,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640371886] [2025-03-08 00:48:34,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:48:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:34,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-08 00:48:34,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:48:34,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:48:34,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:34,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:34,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640371886] [2025-03-08 00:48:34,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640371886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:34,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690179318] [2025-03-08 00:48:34,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:48:34,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:34,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:34,910 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-08 00:48:34,912 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-08 00:48:34,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-08 00:48:34,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:48:34,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:48:34,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:34,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:48:34,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:34,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:35,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690179318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:35,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:35,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 00:48:35,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699893985] [2025-03-08 00:48:35,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:35,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:48:35,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:35,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:48:35,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:48:35,014 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:35,059 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-08 00:48:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:48:35,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 00:48:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:35,060 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:48:35,060 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:48:35,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:48:35,061 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:35,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 32 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:48:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:48:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-08 00:48:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-08 00:48:35,067 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2025-03-08 00:48:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:35,067 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-08 00:48:35,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-08 00:48:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:48:35,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:35,067 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:35,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:35,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:35,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:35,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash 905210606, now seen corresponding path program 4 times [2025-03-08 00:48:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:35,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886032363] [2025-03-08 00:48:35,272 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:48:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:35,279 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:48:35,288 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:48:35,290 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:48:35,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:35,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:35,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886032363] [2025-03-08 00:48:35,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886032363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:35,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445461140] [2025-03-08 00:48:35,596 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:48:35,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:35,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:35,598 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-08 00:48:35,600 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-08 00:48:35,634 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:48:35,650 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:48:35,650 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:48:35,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:35,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 00:48:35,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:35,658 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-08 00:48:35,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:35,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:35,850 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:48:35,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2025-03-08 00:48:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:35,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:36,056 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:48:36,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2025-03-08 00:48:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445461140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:36,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-08 00:48:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485650666] [2025-03-08 00:48:36,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:36,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:48:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:36,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:48:36,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:48:36,204 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:36,914 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2025-03-08 00:48:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 00:48:36,915 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 00:48:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:36,916 INFO L225 Difference]: With dead ends: 48 [2025-03-08 00:48:36,916 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:48:36,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=298, Invalid=1594, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 00:48:36,917 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:36,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 63 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:48:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:48:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2025-03-08 00:48:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-03-08 00:48:36,924 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17 [2025-03-08 00:48:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:36,924 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-03-08 00:48:36,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-03-08 00:48:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:48:36,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:36,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:36,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:37,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:37,125 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:37,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash 906134127, now seen corresponding path program 1 times [2025-03-08 00:48:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:37,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445618764] [2025-03-08 00:48:37,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:37,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:48:37,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:48:37,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:37,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:37,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:37,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445618764] [2025-03-08 00:48:37,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445618764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:37,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950182254] [2025-03-08 00:48:37,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:37,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:37,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:37,315 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-08 00:48:37,316 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-08 00:48:37,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:48:37,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:48:37,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:37,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:37,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 00:48:37,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:37,390 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-08 00:48:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:37,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:37,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-08 00:48:37,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 00:48:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950182254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:37,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:37,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-08 00:48:37,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419636696] [2025-03-08 00:48:37,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:37,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:48:37,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:37,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:48:37,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:48:37,488 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:37,556 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-03-08 00:48:37,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:48:37,558 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 00:48:37,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:37,559 INFO L225 Difference]: With dead ends: 55 [2025-03-08 00:48:37,559 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:48:37,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:48:37,560 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:37,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 53 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:48:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:48:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-08 00:48:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-03-08 00:48:37,567 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2025-03-08 00:48:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:37,567 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-03-08 00:48:37,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-03-08 00:48:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:48:37,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:37,568 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:37,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:37,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:37,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:37,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:37,769 INFO L85 PathProgramCache]: Analyzing trace with hash 116831380, now seen corresponding path program 5 times [2025-03-08 00:48:37,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:37,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923914170] [2025-03-08 00:48:37,769 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:48:37,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:37,777 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-03-08 00:48:37,788 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:48:37,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:48:37,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:37,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:37,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923914170] [2025-03-08 00:48:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923914170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:37,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062874721] [2025-03-08 00:48:37,856 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:48:37,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:37,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:37,858 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-08 00:48:37,859 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-08 00:48:37,895 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-03-08 00:48:37,909 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:48:37,909 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:48:37,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:37,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:48:37,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:37,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:37,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062874721] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:37,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:37,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-08 00:48:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806947228] [2025-03-08 00:48:37,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:37,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:48:37,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:37,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:48:37,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:48:37,995 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:38,102 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-03-08 00:48:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:48:38,104 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 00:48:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:38,104 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:48:38,104 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:48:38,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:48:38,106 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:38,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:48:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2025-03-08 00:48:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-03-08 00:48:38,113 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 18 [2025-03-08 00:48:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:38,113 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-03-08 00:48:38,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-03-08 00:48:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:48:38,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:38,114 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:38,121 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-08 00:48:38,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:38,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:38,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:38,315 INFO L85 PathProgramCache]: Analyzing trace with hash -851226986, now seen corresponding path program 2 times [2025-03-08 00:48:38,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:38,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302171593] [2025-03-08 00:48:38,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:48:38,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:38,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:48:38,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:48:38,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:48:38,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302171593] [2025-03-08 00:48:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302171593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999157856] [2025-03-08 00:48:38,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:48:38,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:38,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:38,412 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-08 00:48:38,413 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-08 00:48:38,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:48:38,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:48:38,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:48:38,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:38,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:48:38,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:38,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:38,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999157856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:38,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:38,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-08 00:48:38,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683866033] [2025-03-08 00:48:38,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:38,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:48:38,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:38,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:48:38,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:48:38,564 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:38,624 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-03-08 00:48:38,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:48:38,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 00:48:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:38,625 INFO L225 Difference]: With dead ends: 48 [2025-03-08 00:48:38,625 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:48:38,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:48:38,626 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:38,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:48:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:48:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-08 00:48:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-08 00:48:38,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2025-03-08 00:48:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:38,632 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-08 00:48:38,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-08 00:48:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:48:38,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:38,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:38,640 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-08 00:48:38,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:48:38,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:38,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1718469551, now seen corresponding path program 6 times [2025-03-08 00:48:38,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:38,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421212833] [2025-03-08 00:48:38,842 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:48:38,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:38,852 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:48:38,869 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:48:38,869 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:48:38,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:39,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:39,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421212833] [2025-03-08 00:48:39,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421212833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:39,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295516872] [2025-03-08 00:48:39,249 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:48:39,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:39,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:39,252 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-08 00:48:39,253 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-08 00:48:39,292 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:48:39,309 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:48:39,309 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:48:39,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:39,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 00:48:39,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:39,316 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-08 00:48:39,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:39,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:39,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:39,702 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-08 00:48:39,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 10 [2025-03-08 00:48:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:39,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:40,224 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-08 00:48:40,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2025-03-08 00:48:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:40,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295516872] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:40,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:40,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2025-03-08 00:48:40,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126427371] [2025-03-08 00:48:40,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:40,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 00:48:40,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:40,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 00:48:40,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1779, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 00:48:40,400 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:41,078 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-08 00:48:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 00:48:41,078 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 00:48:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:41,078 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:48:41,079 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 00:48:41,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=396, Invalid=3144, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 00:48:41,080 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:41,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 91 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:48:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 00:48:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2025-03-08 00:48:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-08 00:48:41,086 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-03-08 00:48:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:41,087 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-08 00:48:41,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-08 00:48:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:48:41,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:41,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:41,094 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-08 00:48:41,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:41,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:41,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:41,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1719393072, now seen corresponding path program 3 times [2025-03-08 00:48:41,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:41,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810022019] [2025-03-08 00:48:41,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:48:41,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:41,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:48:41,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 21 statements. [2025-03-08 00:48:41,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:48:41,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:48:41,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:41,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810022019] [2025-03-08 00:48:41,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810022019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:41,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634619175] [2025-03-08 00:48:41,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:48:41,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:41,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:41,425 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-08 00:48:41,428 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-08 00:48:41,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:48:41,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 21 statements. [2025-03-08 00:48:41,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:48:41,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:41,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:48:41,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:41,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 00:48:41,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:41,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-03-08 00:48:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:48:41,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:48:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634619175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:41,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:41,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2025-03-08 00:48:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041453542] [2025-03-08 00:48:41,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:41,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:48:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:41,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:48:41,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:48:41,589 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:41,677 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-03-08 00:48:41,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:48:41,678 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 00:48:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:41,678 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:48:41,678 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:48:41,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:48:41,679 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:41,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 21 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:48:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:48:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-08 00:48:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-08 00:48:41,685 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-03-08 00:48:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:41,685 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-08 00:48:41,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-08 00:48:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:48:41,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:41,687 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:41,692 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-08 00:48:41,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:48:41,887 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:41,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash -965436748, now seen corresponding path program 7 times [2025-03-08 00:48:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682913223] [2025-03-08 00:48:41,888 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:48:41,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:41,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:48:41,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:48:41,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:41,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:41,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:41,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682913223] [2025-03-08 00:48:41,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682913223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:41,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966792930] [2025-03-08 00:48:41,961 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:48:41,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:41,963 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-08 00:48:41,964 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-08 00:48:42,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:48:42,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:48:42,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:42,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:42,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:48:42,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:42,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:42,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966792930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:42,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:42,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-08 00:48:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131028419] [2025-03-08 00:48:42,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:42,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:48:42,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:42,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:48:42,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:48:42,122 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:42,195 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-08 00:48:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:48:42,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 00:48:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:42,196 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:48:42,196 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:48:42,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:48:42,197 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:42,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:48:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-03-08 00:48:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-08 00:48:42,200 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2025-03-08 00:48:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:42,201 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-08 00:48:42,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-08 00:48:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:48:42,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:42,201 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:42,207 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-08 00:48:42,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:48:42,402 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:42,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1056880050, now seen corresponding path program 8 times [2025-03-08 00:48:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:42,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745045937] [2025-03-08 00:48:42,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:48:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:42,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:48:42,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:48:42,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:48:42,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:42,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:42,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745045937] [2025-03-08 00:48:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745045937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:42,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062941376] [2025-03-08 00:48:42,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:48:42,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:42,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:42,947 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-08 00:48:42,947 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-08 00:48:42,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:48:43,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:48:43,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:48:43,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:43,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 00:48:43,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:43,019 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-08 00:48:43,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:43,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:43,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:43,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:43,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:43,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062941376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:43,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:43,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 46 [2025-03-08 00:48:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385106511] [2025-03-08 00:48:43,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:43,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 00:48:43,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:43,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 00:48:43,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 00:48:43,772 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:44,342 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-08 00:48:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:48:44,343 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 00:48:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:44,343 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:48:44,343 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:48:44,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=260, Invalid=2820, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 00:48:44,344 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:44,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 105 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:48:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:48:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2025-03-08 00:48:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-08 00:48:44,350 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-08 00:48:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:44,350 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-08 00:48:44,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-08 00:48:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:48:44,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:44,350 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:44,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 00:48:44,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:48:44,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:44,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:44,551 INFO L85 PathProgramCache]: Analyzing trace with hash 685930285, now seen corresponding path program 4 times [2025-03-08 00:48:44,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:44,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173008980] [2025-03-08 00:48:44,552 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:48:44,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:44,556 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:48:44,562 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-08 00:48:44,562 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:48:44,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:48:44,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173008980] [2025-03-08 00:48:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173008980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991268014] [2025-03-08 00:48:44,690 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:48:44,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:44,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:44,693 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-08 00:48:44,694 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-08 00:48:44,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:48:44,749 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-08 00:48:44,749 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:48:44,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:44,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 00:48:44,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:44,756 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 16 treesize of output 12 [2025-03-08 00:48:44,763 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 28 treesize of output 27 [2025-03-08 00:48:44,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:44,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 30 [2025-03-08 00:48:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:48:44,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:48:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991268014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:44,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 17 [2025-03-08 00:48:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518477623] [2025-03-08 00:48:44,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:48:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:44,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:48:44,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:48:44,936 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:45,137 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-03-08 00:48:45,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:48:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 00:48:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:45,138 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:48:45,138 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 00:48:45,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:48:45,139 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:45,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 26 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 00:48:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-03-08 00:48:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-08 00:48:45,149 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-08 00:48:45,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:45,149 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-08 00:48:45,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-08 00:48:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:48:45,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:45,150 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:45,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:45,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:48:45,354 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:45,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:45,354 INFO L85 PathProgramCache]: Analyzing trace with hash 403344884, now seen corresponding path program 9 times [2025-03-08 00:48:45,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:45,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143025842] [2025-03-08 00:48:45,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:48:45,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:45,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-08 00:48:45,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:48:45,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:48:45,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:45,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:45,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143025842] [2025-03-08 00:48:45,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143025842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:45,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214221717] [2025-03-08 00:48:45,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:48:45,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:45,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:45,487 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:45,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:48:45,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-08 00:48:45,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:48:45,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:48:45,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:45,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:48:45,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:45,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214221717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:45,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:45,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-08 00:48:45,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473051983] [2025-03-08 00:48:45,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:45,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:48:45,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:45,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:48:45,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:48:45,710 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:45,897 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-03-08 00:48:45,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 00:48:45,897 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 00:48:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:45,898 INFO L225 Difference]: With dead ends: 65 [2025-03-08 00:48:45,898 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 00:48:45,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:48:45,898 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:45,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 33 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 00:48:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 29. [2025-03-08 00:48:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-08 00:48:45,904 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2025-03-08 00:48:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:45,904 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-08 00:48:45,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-08 00:48:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:48:45,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:45,905 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:45,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 00:48:46,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:46,110 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:46,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:46,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1010015157, now seen corresponding path program 10 times [2025-03-08 00:48:46,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:46,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420771299] [2025-03-08 00:48:46,110 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:48:46,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:46,115 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:48:46,119 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:48:46,120 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:48:46,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:46,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:46,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420771299] [2025-03-08 00:48:46,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420771299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:46,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342820852] [2025-03-08 00:48:46,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:48:46,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:46,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:46,205 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:46,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 00:48:46,254 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:48:46,277 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:48:46,278 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:48:46,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:46,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:48:46,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:46,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:46,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342820852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:46,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:46,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-03-08 00:48:46,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338135425] [2025-03-08 00:48:46,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:46,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:48:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:46,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:48:46,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:48:46,417 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:46,508 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-03-08 00:48:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:48:46,508 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-08 00:48:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:46,509 INFO L225 Difference]: With dead ends: 68 [2025-03-08 00:48:46,509 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:48:46,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:48:46,509 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 73 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:46,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 16 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:48:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-03-08 00:48:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-08 00:48:46,516 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 28 [2025-03-08 00:48:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:46,516 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-08 00:48:46,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-08 00:48:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:48:46,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:46,517 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:46,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:46,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 00:48:46,718 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:46,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1152717233, now seen corresponding path program 11 times [2025-03-08 00:48:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812559135] [2025-03-08 00:48:46,719 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:48:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:46,724 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:48:46,729 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:48:46,729 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:48:46,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:47,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:47,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812559135] [2025-03-08 00:48:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812559135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082355217] [2025-03-08 00:48:47,355 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:48:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:47,358 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:47,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:48:47,407 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:48:47,450 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:48:47,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:48:47,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:47,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-08 00:48:47,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:47,525 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-08 00:48:47,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:47,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:48,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:48,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:48,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:48,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:49,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:49,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 21 [2025-03-08 00:48:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:49,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082355217] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:49,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:49,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 24] total 67 [2025-03-08 00:48:49,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745583819] [2025-03-08 00:48:49,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:49,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-08 00:48:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:49,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-08 00:48:49,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=3991, Unknown=0, NotChecked=0, Total=4422 [2025-03-08 00:48:49,409 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 67 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:52,659 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2025-03-08 00:48:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-08 00:48:52,659 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 00:48:52,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:52,660 INFO L225 Difference]: With dead ends: 89 [2025-03-08 00:48:52,660 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 00:48:52,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3027 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1429, Invalid=12143, Unknown=0, NotChecked=0, Total=13572 [2025-03-08 00:48:52,662 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:52,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 66 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:48:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 00:48:52,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2025-03-08 00:48:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-03-08 00:48:52,677 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2025-03-08 00:48:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:52,677 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-03-08 00:48:52,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-03-08 00:48:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:48:52,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:52,678 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:52,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:52,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:48:52,881 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:52,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1345298704, now seen corresponding path program 5 times [2025-03-08 00:48:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32748691] [2025-03-08 00:48:52,882 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:48:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:52,887 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:48:52,895 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:48:52,895 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:48:52,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:48:53,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:53,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32748691] [2025-03-08 00:48:53,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32748691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:53,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491067033] [2025-03-08 00:48:53,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:48:53,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:53,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:53,131 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:53,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:48:53,185 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:48:53,227 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:48:53,227 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:48:53,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:53,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 00:48:53,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:53,241 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-08 00:48:53,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:48:53,259 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 21 treesize of output 20 [2025-03-08 00:48:53,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:48:53,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:48:53,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:48:53,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:53,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-08 00:48:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:48:57,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:57,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-08 00:48:57,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-03-08 00:48:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:48:57,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491067033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:57,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:57,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 27 [2025-03-08 00:48:57,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90399066] [2025-03-08 00:48:57,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:57,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:48:57,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:57,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:48:57,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=590, Unknown=1, NotChecked=0, Total=702 [2025-03-08 00:48:57,815 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:58,041 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2025-03-08 00:48:58,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:48:58,042 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 00:48:58,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:58,042 INFO L225 Difference]: With dead ends: 93 [2025-03-08 00:48:58,042 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 00:48:58,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=153, Invalid=776, Unknown=1, NotChecked=0, Total=930 [2025-03-08 00:48:58,043 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:58,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 84 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:58,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 00:48:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2025-03-08 00:48:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.1875) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2025-03-08 00:48:58,058 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 29 [2025-03-08 00:48:58,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:58,058 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2025-03-08 00:48:58,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2025-03-08 00:48:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:48:58,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:58,058 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:58,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:48:58,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:58,259 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:58,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash 522055413, now seen corresponding path program 12 times [2025-03-08 00:48:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:58,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079500538] [2025-03-08 00:48:58,259 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:48:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:58,267 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 6 equivalence classes. [2025-03-08 00:48:58,285 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:48:58,286 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:48:58,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:58,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079500538] [2025-03-08 00:48:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079500538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591318578] [2025-03-08 00:48:58,400 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:48:58,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:58,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:58,403 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:58,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:48:58,454 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 6 equivalence classes. [2025-03-08 00:48:58,475 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:48:58,475 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:48:58,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:58,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:48:58,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:58,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:58,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591318578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:58,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:58,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-03-08 00:48:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170361331] [2025-03-08 00:48:58,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:58,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:48:58,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:58,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:48:58,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:48:58,634 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:58,816 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2025-03-08 00:48:58,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:48:58,817 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 00:48:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:58,817 INFO L225 Difference]: With dead ends: 90 [2025-03-08 00:48:58,817 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 00:48:58,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 00:48:58,819 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:58,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 21 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 00:48:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2025-03-08 00:48:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 67 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2025-03-08 00:48:58,836 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 30 [2025-03-08 00:48:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:58,836 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2025-03-08 00:48:58,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2025-03-08 00:48:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:48:58,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:58,836 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:58,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 00:48:59,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:59,037 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:59,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:59,037 INFO L85 PathProgramCache]: Analyzing trace with hash 594567598, now seen corresponding path program 13 times [2025-03-08 00:48:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224795277] [2025-03-08 00:48:59,037 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:48:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:59,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:48:59,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:48:59,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:59,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224795277] [2025-03-08 00:48:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224795277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369041375] [2025-03-08 00:48:59,770 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:48:59,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:59,772 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:59,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:48:59,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:48:59,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:48:59,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:59,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:59,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-08 00:48:59,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:59,846 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-08 00:48:59,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:48:59,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:00,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:00,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:00,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:00,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:00,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:01,022 INFO L349 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2025-03-08 00:49:01,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 25 [2025-03-08 00:49:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:01,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369041375] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:01,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:01,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 23] total 61 [2025-03-08 00:49:01,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775729287] [2025-03-08 00:49:01,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:01,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-08 00:49:01,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:01,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-08 00:49:01,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3444, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 00:49:01,251 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 61 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:02,277 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2025-03-08 00:49:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:49:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 00:49:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:02,278 INFO L225 Difference]: With dead ends: 95 [2025-03-08 00:49:02,278 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 00:49:02,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=326, Invalid=5076, Unknown=0, NotChecked=0, Total=5402 [2025-03-08 00:49:02,279 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:02,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:49:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 00:49:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2025-03-08 00:49:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2025-03-08 00:49:02,297 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 33 [2025-03-08 00:49:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:02,297 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2025-03-08 00:49:02,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2025-03-08 00:49:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:49:02,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:02,297 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:02,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-08 00:49:02,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:02,498 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:02,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1202383761, now seen corresponding path program 6 times [2025-03-08 00:49:02,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:02,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421066748] [2025-03-08 00:49:02,498 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:02,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:02,505 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 7 equivalence classes. [2025-03-08 00:49:02,525 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:49:02,527 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:49:02,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:02,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:02,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421066748] [2025-03-08 00:49:02,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421066748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:02,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836680005] [2025-03-08 00:49:02,825 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:02,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:02,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:02,827 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:02,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 00:49:02,888 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 7 equivalence classes. [2025-03-08 00:49:02,932 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:49:02,933 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:49:02,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:02,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 00:49:02,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:02,937 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 16 treesize of output 12 [2025-03-08 00:49:02,951 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 29 treesize of output 28 [2025-03-08 00:49:02,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:02,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-03-08 00:49:03,687 INFO L349 Elim1Store]: treesize reduction 30, result has 56.5 percent of original size [2025-03-08 00:49:03,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 54 [2025-03-08 00:49:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 43 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:49:03,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:49:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836680005] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:04,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:04,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 38 [2025-03-08 00:49:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560641104] [2025-03-08 00:49:04,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:04,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 00:49:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:04,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 00:49:04,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1242, Unknown=2, NotChecked=0, Total=1406 [2025-03-08 00:49:04,120 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 38 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:06,109 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2025-03-08 00:49:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 00:49:06,112 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 00:49:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:06,112 INFO L225 Difference]: With dead ends: 124 [2025-03-08 00:49:06,113 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 00:49:06,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=760, Invalid=4350, Unknown=2, NotChecked=0, Total=5112 [2025-03-08 00:49:06,114 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:06,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 99 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:49:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 00:49:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 78. [2025-03-08 00:49:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2025-03-08 00:49:06,139 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 33 [2025-03-08 00:49:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:06,139 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2025-03-08 00:49:06,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2025-03-08 00:49:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:49:06,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:06,140 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:06,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 00:49:06,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 00:49:06,344 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:06,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1860607828, now seen corresponding path program 14 times [2025-03-08 00:49:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:06,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223898935] [2025-03-08 00:49:06,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:06,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:49:06,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:49:06,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:06,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:06,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:06,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223898935] [2025-03-08 00:49:06,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223898935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:06,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155718243] [2025-03-08 00:49:06,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:06,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:06,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:06,508 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:06,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:49:06,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:49:06,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:49:06,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:06,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:06,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:49:06,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:06,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:06,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155718243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:06,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:06,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2025-03-08 00:49:06,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106702002] [2025-03-08 00:49:06,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:06,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 00:49:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:06,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 00:49:06,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:49:06,839 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:07,118 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2025-03-08 00:49:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 00:49:07,119 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-08 00:49:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:07,119 INFO L225 Difference]: With dead ends: 123 [2025-03-08 00:49:07,119 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 00:49:07,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:49:07,120 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:07,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 40 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:49:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 00:49:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 66. [2025-03-08 00:49:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-03-08 00:49:07,139 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 34 [2025-03-08 00:49:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:07,139 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-03-08 00:49:07,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-03-08 00:49:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 00:49:07,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:07,140 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:07,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-08 00:49:07,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 00:49:07,340 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:07,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash 436521045, now seen corresponding path program 15 times [2025-03-08 00:49:07,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:07,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305924258] [2025-03-08 00:49:07,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:07,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 8 equivalence classes. [2025-03-08 00:49:07,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 00:49:07,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 00:49:07,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 54 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:07,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:07,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305924258] [2025-03-08 00:49:07,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305924258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:07,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717112931] [2025-03-08 00:49:07,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:07,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:07,487 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:07,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 00:49:07,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 8 equivalence classes. [2025-03-08 00:49:07,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 00:49:07,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 00:49:07,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:07,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:49:07,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 70 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:07,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 70 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:07,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717112931] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:07,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:07,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2025-03-08 00:49:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54254527] [2025-03-08 00:49:07,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:07,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:49:07,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:07,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:49:07,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:49:07,840 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:08,081 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2025-03-08 00:49:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:49:08,082 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-08 00:49:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:08,082 INFO L225 Difference]: With dead ends: 131 [2025-03-08 00:49:08,082 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 00:49:08,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 51 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=336, Invalid=996, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 00:49:08,083 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 113 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:08,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 25 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 00:49:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2025-03-08 00:49:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-08 00:49:08,096 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 36 [2025-03-08 00:49:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:08,096 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-08 00:49:08,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-08 00:49:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:49:08,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:08,098 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:08,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 00:49:08,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:08,298 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:08,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1361780497, now seen corresponding path program 16 times [2025-03-08 00:49:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:08,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102326904] [2025-03-08 00:49:08,299 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:08,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:08,306 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:49:08,313 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:49:08,313 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:49:08,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:09,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:09,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102326904] [2025-03-08 00:49:09,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102326904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:09,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169256065] [2025-03-08 00:49:09,081 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:09,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:09,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:09,083 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:09,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 00:49:09,142 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:49:09,186 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:49:09,186 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:49:09,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:09,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-08 00:49:09,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:09,192 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-08 00:49:09,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:09,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:09,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:09,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:10,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:10,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:11,475 INFO L349 Elim1Store]: treesize reduction 168, result has 0.6 percent of original size [2025-03-08 00:49:11,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 78 treesize of output 22 [2025-03-08 00:49:11,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 21 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:11,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:15,636 INFO L349 Elim1Store]: treesize reduction 168, result has 0.6 percent of original size [2025-03-08 00:49:15,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 29 [2025-03-08 00:49:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169256065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:16,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 93 [2025-03-08 00:49:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90697334] [2025-03-08 00:49:16,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:16,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-03-08 00:49:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:16,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-03-08 00:49:16,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=7905, Unknown=0, NotChecked=0, Total=8556 [2025-03-08 00:49:16,177 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 93 states, 93 states have (on average 1.075268817204301) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:20,925 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2025-03-08 00:49:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-08 00:49:20,926 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 1.075268817204301) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-08 00:49:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:20,926 INFO L225 Difference]: With dead ends: 88 [2025-03-08 00:49:20,926 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 00:49:20,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4786 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1484, Invalid=14772, Unknown=0, NotChecked=0, Total=16256 [2025-03-08 00:49:20,928 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:20,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 122 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 00:49:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 00:49:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 41. [2025-03-08 00:49:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-03-08 00:49:20,943 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 37 [2025-03-08 00:49:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:20,943 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-03-08 00:49:20,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 1.075268817204301) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-03-08 00:49:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 00:49:20,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:20,944 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:20,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-08 00:49:21,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:21,144 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:21,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1576629620, now seen corresponding path program 17 times [2025-03-08 00:49:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:21,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035489398] [2025-03-08 00:49:21,145 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:21,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:21,151 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 9 equivalence classes. [2025-03-08 00:49:21,157 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:49:21,158 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:49:21,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:21,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035489398] [2025-03-08 00:49:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035489398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509172756] [2025-03-08 00:49:21,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:21,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:21,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:21,311 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:21,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 00:49:21,380 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 9 equivalence classes. [2025-03-08 00:49:21,468 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:49:21,468 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:49:21,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:21,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:49:21,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:21,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509172756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:21,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:21,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 26 [2025-03-08 00:49:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044779770] [2025-03-08 00:49:21,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:21,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 00:49:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:21,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 00:49:21,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:49:21,704 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:21,878 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2025-03-08 00:49:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:49:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-08 00:49:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:21,879 INFO L225 Difference]: With dead ends: 107 [2025-03-08 00:49:21,879 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 00:49:21,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:49:21,880 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 66 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:21,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 40 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 00:49:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2025-03-08 00:49:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-08 00:49:21,895 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 40 [2025-03-08 00:49:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:21,895 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-08 00:49:21,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-08 00:49:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:49:21,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:21,895 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:21,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-08 00:49:22,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 00:49:22,096 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:22,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1702342926, now seen corresponding path program 18 times [2025-03-08 00:49:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:22,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414243785] [2025-03-08 00:49:22,096 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:22,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:22,103 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 9 equivalence classes. [2025-03-08 00:49:22,120 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:49:22,120 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-08 00:49:22,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:23,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:23,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414243785] [2025-03-08 00:49:23,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414243785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:23,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317973756] [2025-03-08 00:49:23,128 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:23,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:23,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:23,130 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:23,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 00:49:23,196 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 9 equivalence classes. [2025-03-08 00:49:23,302 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:49:23,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-08 00:49:23,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:23,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-08 00:49:23,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:23,311 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-08 00:49:23,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:23,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:23,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:23,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:24,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:24,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:24,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:24,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:24,449 INFO L349 Elim1Store]: treesize reduction 224, result has 0.4 percent of original size [2025-03-08 00:49:24,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 73 treesize of output 25 [2025-03-08 00:49:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:24,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:27,980 INFO L349 Elim1Store]: treesize reduction 238, result has 0.4 percent of original size [2025-03-08 00:49:27,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 98 treesize of output 33 [2025-03-08 00:49:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:28,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317973756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:28,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:28,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30, 30] total 91 [2025-03-08 00:49:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030486860] [2025-03-08 00:49:28,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:28,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-03-08 00:49:28,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:28,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-03-08 00:49:28,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=7867, Unknown=0, NotChecked=0, Total=8190 [2025-03-08 00:49:28,443 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 91 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:30,281 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2025-03-08 00:49:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 00:49:30,281 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-08 00:49:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:30,282 INFO L225 Difference]: With dead ends: 73 [2025-03-08 00:49:30,282 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 00:49:30,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3699 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=529, Invalid=11243, Unknown=0, NotChecked=0, Total=11772 [2025-03-08 00:49:30,283 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2209 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:30,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 178 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2209 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 00:49:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 00:49:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2025-03-08 00:49:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-03-08 00:49:30,305 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 41 [2025-03-08 00:49:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:30,306 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-03-08 00:49:30,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-03-08 00:49:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:49:30,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:30,306 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:30,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-08 00:49:30,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 00:49:30,507 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:30,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1196784301, now seen corresponding path program 7 times [2025-03-08 00:49:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084215885] [2025-03-08 00:49:30,507 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:49:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:30,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:49:30,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:49:30,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:30,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 21 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:30,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084215885] [2025-03-08 00:49:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084215885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:30,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255243029] [2025-03-08 00:49:30,935 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:49:30,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:30,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:30,938 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:30,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 00:49:31,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:49:31,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:49:31,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:31,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:31,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 00:49:31,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:31,106 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-08 00:49:31,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:31,129 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 21 treesize of output 20 [2025-03-08 00:49:31,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:31,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:31,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:31,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:31,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-08 00:49:31,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:31,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:31,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:31,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:31,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:31,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:31,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:31,225 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 39 treesize of output 44 [2025-03-08 00:49:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:49:36,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:37,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-08 00:49:37,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-03-08 00:49:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 56 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:49:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255243029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:37,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 15] total 48 [2025-03-08 00:49:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555325814] [2025-03-08 00:49:37,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:37,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-08 00:49:37,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:37,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-08 00:49:37,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1992, Unknown=2, NotChecked=0, Total=2256 [2025-03-08 00:49:37,838 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 48 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:41,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:49:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:42,113 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2025-03-08 00:49:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:49:42,113 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-08 00:49:42,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:42,114 INFO L225 Difference]: With dead ends: 89 [2025-03-08 00:49:42,114 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 00:49:42,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=481, Invalid=3057, Unknown=2, NotChecked=0, Total=3540 [2025-03-08 00:49:42,115 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 105 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:42,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 97 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 764 Invalid, 3 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 00:49:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 00:49:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2025-03-08 00:49:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-03-08 00:49:42,141 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 41 [2025-03-08 00:49:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:42,141 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-03-08 00:49:42,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-03-08 00:49:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 00:49:42,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:42,142 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:42,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-08 00:49:42,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 00:49:42,342 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:42,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:42,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1304488116, now seen corresponding path program 19 times [2025-03-08 00:49:42,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:42,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97268318] [2025-03-08 00:49:42,343 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:49:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:42,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 00:49:42,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:49:42,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:42,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 28 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97268318] [2025-03-08 00:49:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97268318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908004486] [2025-03-08 00:49:42,542 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:49:42,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:42,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:42,544 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:42,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-08 00:49:42,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 00:49:42,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:49:42,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:42,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:42,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 00:49:42,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 36 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:42,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 36 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:42,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908004486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:42,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:42,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 32 [2025-03-08 00:49:42,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140379148] [2025-03-08 00:49:42,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:42,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:49:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:42,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:49:42,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:49:42,930 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 32 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:43,369 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2025-03-08 00:49:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 00:49:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-08 00:49:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:43,373 INFO L225 Difference]: With dead ends: 111 [2025-03-08 00:49:43,373 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 00:49:43,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=538, Invalid=1912, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 00:49:43,377 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:43,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 38 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:49:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 00:49:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 45. [2025-03-08 00:49:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-08 00:49:43,410 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2025-03-08 00:49:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:43,411 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-08 00:49:43,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-08 00:49:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:49:43,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:43,411 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:43,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-08 00:49:43,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 00:49:43,612 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:43,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:43,612 INFO L85 PathProgramCache]: Analyzing trace with hash -357384971, now seen corresponding path program 20 times [2025-03-08 00:49:43,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:43,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010998936] [2025-03-08 00:49:43,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:43,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:43,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 00:49:43,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:49:43,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:43,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 95 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010998936] [2025-03-08 00:49:43,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010998936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172702847] [2025-03-08 00:49:43,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:43,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:43,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:43,805 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:43,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-08 00:49:43,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 00:49:43,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:49:43,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:43,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:43,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 00:49:43,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 117 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:44,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 117 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172702847] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:44,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:44,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2025-03-08 00:49:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87675228] [2025-03-08 00:49:44,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:44,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:49:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:44,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:49:44,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:49:44,208 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 31 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:44,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:44,401 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2025-03-08 00:49:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 00:49:44,401 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-08 00:49:44,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:44,402 INFO L225 Difference]: With dead ends: 114 [2025-03-08 00:49:44,402 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 00:49:44,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 16 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 00:49:44,402 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 108 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:44,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 28 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 00:49:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2025-03-08 00:49:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-08 00:49:44,423 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 44 [2025-03-08 00:49:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:44,423 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-08 00:49:44,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-08 00:49:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:49:44,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:44,424 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:44,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-08 00:49:44,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:44,625 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:44,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:44,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1259707279, now seen corresponding path program 21 times [2025-03-08 00:49:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:44,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105372980] [2025-03-08 00:49:44,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:44,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 10 equivalence classes. [2025-03-08 00:49:44,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:49:44,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-08 00:49:44,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:45,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:45,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105372980] [2025-03-08 00:49:45,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105372980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:45,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456281994] [2025-03-08 00:49:45,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:45,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:45,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:45,894 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:45,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-08 00:49:45,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 10 equivalence classes. [2025-03-08 00:49:46,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:49:46,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-08 00:49:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:46,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-03-08 00:49:46,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:46,111 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-08 00:49:46,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 00:49:46,154 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 23 treesize of output 22 [2025-03-08 00:49:46,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:46,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-08 00:49:46,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:46,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-08 00:49:46,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:46,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58 [2025-03-08 00:49:46,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:46,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 70 [2025-03-08 00:49:46,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:46,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 82 [2025-03-08 00:49:46,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:46,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:47,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:47,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:49:47,434 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 29 treesize of output 21 [2025-03-08 00:49:47,757 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 36 treesize of output 24 [2025-03-08 00:49:48,160 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 36 treesize of output 24 [2025-03-08 00:49:48,597 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 36 treesize of output 24 [2025-03-08 00:49:49,183 INFO L349 Elim1Store]: treesize reduction 430, result has 10.6 percent of original size [2025-03-08 00:49:49,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 168 treesize of output 105 [2025-03-08 00:49:49,188 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 99 treesize of output 63 [2025-03-08 00:49:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:49,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:53,364 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 331 treesize of output 321 [2025-03-08 00:49:53,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:53,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2872 treesize of output 2876 [2025-03-08 00:49:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:53,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456281994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:53,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:53,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 110 [2025-03-08 00:49:53,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600705789] [2025-03-08 00:49:53,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:53,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2025-03-08 00:49:53,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:53,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2025-03-08 00:49:53,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=11458, Unknown=0, NotChecked=0, Total=11990 [2025-03-08 00:49:53,943 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 110 states, 110 states have (on average 1.1) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:03,901 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2025-03-08 00:50:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-08 00:50:03,901 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 110 states have (on average 1.1) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-08 00:50:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:03,901 INFO L225 Difference]: With dead ends: 101 [2025-03-08 00:50:03,901 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 00:50:03,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6360 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1311, Invalid=21039, Unknown=0, NotChecked=0, Total=22350 [2025-03-08 00:50:03,903 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 3583 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 3763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 3583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:03,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 226 Invalid, 3763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 3583 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 00:50:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 00:50:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2025-03-08 00:50:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.16) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-03-08 00:50:03,945 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 45 [2025-03-08 00:50:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:03,945 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-03-08 00:50:03,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 110 states have (on average 1.1) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-03-08 00:50:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:50:03,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:03,946 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:03,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:04,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:04,146 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:04,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash -150040523, now seen corresponding path program 22 times [2025-03-08 00:50:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:04,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632196198] [2025-03-08 00:50:04,147 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:04,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:04,154 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-08 00:50:04,158 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:50:04,158 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:50:04,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 45 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632196198] [2025-03-08 00:50:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632196198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632905763] [2025-03-08 00:50:04,383 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:04,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:04,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:04,386 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:04,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-08 00:50:04,476 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-08 00:50:04,604 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:50:04,604 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:50:04,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:04,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 00:50:04,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 45 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:04,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 45 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:04,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632905763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:04,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:04,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 33 [2025-03-08 00:50:04,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365511477] [2025-03-08 00:50:04,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:04,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 00:50:04,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:04,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 00:50:04,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:50:04,908 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:05,387 INFO L93 Difference]: Finished difference Result 147 states and 176 transitions. [2025-03-08 00:50:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 00:50:05,387 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 00:50:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:05,388 INFO L225 Difference]: With dead ends: 147 [2025-03-08 00:50:05,388 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 00:50:05,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 21 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=659, Invalid=2203, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 00:50:05,389 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 53 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:05,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 38 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:50:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 00:50:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 79. [2025-03-08 00:50:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2025-03-08 00:50:05,442 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 46 [2025-03-08 00:50:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:05,442 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2025-03-08 00:50:05,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2025-03-08 00:50:05,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:50:05,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:05,442 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:05,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0