./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s5lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s5lif.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 ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:40:47,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:40:47,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:40:47,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:40:47,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:40:47,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:40:47,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:40:47,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:40:47,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:40:47,794 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:40:47,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:40:47,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:40:47,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:40:47,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:40:47,794 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:40:47,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:40:47,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:40:47,794 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:40:47,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:40:47,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:40:47,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:40:47,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:40:47,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:40:47,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:40:47,796 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:40:47,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:40:47,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:40:47,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:40:47,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:40:47,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:40:47,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:40:47,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:40:47,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:40:47,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:40:47,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:40:47,797 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:40:47,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:40:47,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:40:47,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:40:47,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:40:47,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:40:47,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:40:47,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:40:47,798 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 -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2025-03-03 09:40:48,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:40:48,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:40:48,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:40:48,054 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:40:48,054 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:40:48,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5lif.c [2025-03-03 09:40:49,166 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69fce7f5/dfe64194cbcf46a389e9dcf1184a79ee/FLAG7f3d78971 [2025-03-03 09:40:49,377 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:40:49,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5lif.c [2025-03-03 09:40:49,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69fce7f5/dfe64194cbcf46a389e9dcf1184a79ee/FLAG7f3d78971 [2025-03-03 09:40:49,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69fce7f5/dfe64194cbcf46a389e9dcf1184a79ee [2025-03-03 09:40:49,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:40:49,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:40:49,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:40:49,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:40:49,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:40:49,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c7fe49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49, skipping insertion in model container [2025-03-03 09:40:49,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:40:49,871 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/s5lif.c[588,601] [2025-03-03 09:40:49,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:40:49,899 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:40:49,909 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/s5lif.c[588,601] [2025-03-03 09:40:49,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:40:49,931 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:40:49,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49 WrapperNode [2025-03-03 09:40:49,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:40:49,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:40:49,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:40:49,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:40:49,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,962 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2025-03-03 09:40:49,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:40:49,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:40:49,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:40:49,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:40:49,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,990 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 8, 7, 4]. 38 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 5 writes are split as follows [0, 0, 3, 2]. [2025-03-03 09:40:49,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:49,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:50,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:40:50,002 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:40:50,003 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:40:50,003 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:40:50,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (1/1) ... [2025-03-03 09:40:50,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:40:50,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:50,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:40:50,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:40:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:40:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:40:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:40:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:40:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 09:40:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:40:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:40:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:40:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:40:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 09:40:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 09:40:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:40:50,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:40:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:40:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:40:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:40:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 09:40:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:40:50,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:40:50,117 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:40:50,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-03 09:40:50,232 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:40:50,232 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:40:50,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:40:50,238 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:40:50,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:40:50 BoogieIcfgContainer [2025-03-03 09:40:50,238 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:40:50,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:40:50,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:40:50,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:40:50,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:40:49" (1/3) ... [2025-03-03 09:40:50,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa0648c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:40:50, skipping insertion in model container [2025-03-03 09:40:50,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:49" (2/3) ... [2025-03-03 09:40:50,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa0648c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:40:50, skipping insertion in model container [2025-03-03 09:40:50,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:40:50" (3/3) ... [2025-03-03 09:40:50,245 INFO L128 eAbstractionObserver]: Analyzing ICFG s5lif.c [2025-03-03 09:40:50,255 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:40:50,257 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s5lif.c that has 1 procedures, 17 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:40:50,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:40:50,318 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;@56e35ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:40:50,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:40:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 09:40:50,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:50,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:50,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:50,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1915737109, now seen corresponding path program 1 times [2025-03-03 09:40:50,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:50,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798248710] [2025-03-03 09:40:50,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:50,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 09:40:50,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 09:40:50,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:50,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:50,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:50,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798248710] [2025-03-03 09:40:50,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798248710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:40:50,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:40:50,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:40:50,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106483377] [2025-03-03 09:40:50,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:40:50,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:40:50,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:50,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:40:50,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:40:50,483 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:50,490 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-03-03 09:40:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:40:50,492 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 09:40:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:50,496 INFO L225 Difference]: With dead ends: 30 [2025-03-03 09:40:50,496 INFO L226 Difference]: Without dead ends: 13 [2025-03-03 09:40:50,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:40:50,500 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:50,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:40:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-03 09:40:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-03 09:40:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-03-03 09:40:50,527 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2025-03-03 09:40:50,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:50,528 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-03 09:40:50,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-03-03 09:40:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 09:40:50,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:50,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:50,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:40:50,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:50,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:50,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1491726506, now seen corresponding path program 1 times [2025-03-03 09:40:50,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:50,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869607431] [2025-03-03 09:40:50,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:50,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:50,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 09:40:50,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 09:40:50,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:50,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:50,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:50,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869607431] [2025-03-03 09:40:50,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869607431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:40:50,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:40:50,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:40:50,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455397304] [2025-03-03 09:40:50,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:40:50,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:40:50,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:50,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:40:50,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:40:50,676 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:50,726 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2025-03-03 09:40:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:40:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 09:40:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:50,727 INFO L225 Difference]: With dead ends: 25 [2025-03-03 09:40:50,727 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 09:40:50,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:40:50,728 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:50,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:40:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 09:40:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-03 09:40:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-03-03 09:40:50,731 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2025-03-03 09:40:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:50,731 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-03 09:40:50,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-03-03 09:40:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 09:40:50,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:50,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:50,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:40:50,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:50,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash 322328624, now seen corresponding path program 1 times [2025-03-03 09:40:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:50,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908786364] [2025-03-03 09:40:50,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:50,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:50,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:40:50,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:40:50,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:50,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:51,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908786364] [2025-03-03 09:40:51,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908786364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238988540] [2025-03-03 09:40:51,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:51,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:51,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:51,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:51,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:40:51,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:40:51,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:40:51,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:51,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:51,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 09:40:51,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:51,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:40:51,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:51,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:51,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:51,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-03 09:40:51,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:51,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2025-03-03 09:40:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238988540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:51,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:51,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-03 09:40:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306127784] [2025-03-03 09:40:51,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:51,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:40:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:51,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:40:51,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:40:51,972 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:52,288 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2025-03-03 09:40:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:40:52,289 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 09:40:52,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:52,290 INFO L225 Difference]: With dead ends: 40 [2025-03-03 09:40:52,290 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 09:40:52,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2025-03-03 09:40:52,291 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:52,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 38 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:40:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 09:40:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2025-03-03 09:40:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-03 09:40:52,299 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2025-03-03 09:40:52,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:52,300 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-03 09:40:52,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-03 09:40:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 09:40:52,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:52,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:52,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:40:52,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:52,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:52,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1209832305, now seen corresponding path program 1 times [2025-03-03 09:40:52,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:52,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530984530] [2025-03-03 09:40:52,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:52,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:52,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:40:52,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:40:52,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:52,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:40:52,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:52,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530984530] [2025-03-03 09:40:52,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530984530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:52,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068500324] [2025-03-03 09:40:52,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:52,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:52,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:52,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:52,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:40:52,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:40:52,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:40:52,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:52,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:52,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:40:52,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:52,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:40:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:40:52,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:52,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-03 09:40:52,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-03 09:40:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:40:52,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068500324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:52,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:52,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 09:40:52,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728994998] [2025-03-03 09:40:52,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:52,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:40:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:52,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:40:52,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:40:52,810 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:52,861 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-03-03 09:40:52,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:40:52,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 09:40:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:52,861 INFO L225 Difference]: With dead ends: 35 [2025-03-03 09:40:52,862 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 09:40:52,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:40:52,862 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:52,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:40:52,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 09:40:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-03 09:40:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-03 09:40:52,869 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2025-03-03 09:40:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:52,869 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-03 09:40:52,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-03 09:40:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:40:52,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:52,870 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:52,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:40:53,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:40:53,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:53,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:53,071 INFO L85 PathProgramCache]: Analyzing trace with hash -493973740, now seen corresponding path program 2 times [2025-03-03 09:40:53,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:53,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885790483] [2025-03-03 09:40:53,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:53,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:53,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-03 09:40:53,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:40:53,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:53,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:40:53,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:53,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885790483] [2025-03-03 09:40:53,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885790483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:53,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617916857] [2025-03-03 09:40:53,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:53,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:53,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:53,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:53,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:40:53,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-03 09:40:53,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:40:53,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:53,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:53,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:40:53,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:40:53,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:40:53,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617916857] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:53,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:53,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:40:53,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230984181] [2025-03-03 09:40:53,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:53,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:40:53,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:53,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:40:53,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:40:53,263 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:53,373 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-03-03 09:40:53,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:40:53,373 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 09:40:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:53,374 INFO L225 Difference]: With dead ends: 39 [2025-03-03 09:40:53,374 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 09:40:53,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:40:53,374 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:53,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 09:40:53,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2025-03-03 09:40:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-03 09:40:53,382 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2025-03-03 09:40:53,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:53,382 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-03 09:40:53,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-03 09:40:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:40:53,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:53,382 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:53,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:40:53,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:53,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:53,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1402284501, now seen corresponding path program 3 times [2025-03-03 09:40:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:53,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105143328] [2025-03-03 09:40:53,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:53,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-03 09:40:53,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:40:53,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:40:53,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:40:53,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:53,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105143328] [2025-03-03 09:40:53,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105143328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:53,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915212279] [2025-03-03 09:40:53,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:53,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:53,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:53,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:53,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:40:53,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-03 09:40:53,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:40:53,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:40:53,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:53,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:40:53,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:40:53,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:40:53,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915212279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:53,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:53,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:40:53,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297930801] [2025-03-03 09:40:53,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:53,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:40:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:53,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:40:53,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:40:53,766 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:53,823 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-03-03 09:40:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:40:53,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 09:40:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:53,823 INFO L225 Difference]: With dead ends: 38 [2025-03-03 09:40:53,824 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 09:40:53,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:40:53,824 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:53,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:40:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 09:40:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-03 09:40:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-03 09:40:53,828 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2025-03-03 09:40:53,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:53,828 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-03 09:40:53,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-03 09:40:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:40:53,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:53,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:53,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:40:54,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:54,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:54,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash -96415722, now seen corresponding path program 4 times [2025-03-03 09:40:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332981308] [2025-03-03 09:40:54,030 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:54,039 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-03 09:40:54,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:40:54,053 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:40:54,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:40:54,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332981308] [2025-03-03 09:40:54,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332981308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027651477] [2025-03-03 09:40:54,807 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:54,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:54,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:54,809 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:54,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:40:54,847 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-03 09:40:54,864 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:40:54,865 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:40:54,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:54,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 09:40:54,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:54,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:40:55,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:55,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:55,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:40:55,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:55,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:55,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:55,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2025-03-03 09:40:55,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:55,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 394 treesize of output 391 [2025-03-03 09:40:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:55,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027651477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:55,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:55,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2025-03-03 09:40:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097716338] [2025-03-03 09:40:55,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:55,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 09:40:55,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:55,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 09:40:55,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 09:40:55,741 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:58,284 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2025-03-03 09:40:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-03 09:40:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 09:40:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:58,285 INFO L225 Difference]: With dead ends: 77 [2025-03-03 09:40:58,285 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 09:40:58,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1068, Invalid=6072, Unknown=0, NotChecked=0, Total=7140 [2025-03-03 09:40:58,288 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 97 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:58,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 76 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:40:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 09:40:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2025-03-03 09:40:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2025-03-03 09:40:58,301 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 20 [2025-03-03 09:40:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:58,301 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2025-03-03 09:40:58,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2025-03-03 09:40:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:40:58,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:58,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:58,307 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-03 09:40:58,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:58,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:58,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1646394613, now seen corresponding path program 1 times [2025-03-03 09:40:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:58,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925297065] [2025-03-03 09:40:58,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:58,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:40:58,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:40:58,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:58,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:40:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:58,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925297065] [2025-03-03 09:40:58,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925297065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:58,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110155884] [2025-03-03 09:40:58,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:58,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:58,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:58,679 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:58,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:40:58,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:40:58,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:40:58,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:58,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:58,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:40:58,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:58,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:40:58,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:58,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2025-03-03 09:40:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:40:58,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:58,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-03 09:40:58,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:40:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:40:58,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110155884] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:58,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:58,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-03 09:40:58,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000231733] [2025-03-03 09:40:58,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:58,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:40:58,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:58,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:40:58,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:40:58,833 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:58,917 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2025-03-03 09:40:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:40:58,918 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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) Word has length 20 [2025-03-03 09:40:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:58,918 INFO L225 Difference]: With dead ends: 64 [2025-03-03 09:40:58,918 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 09:40:58,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 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-03 09:40:58,919 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:58,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 64 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 09:40:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-03 09:40:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-03-03 09:40:58,931 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 20 [2025-03-03 09:40:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:58,931 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-03-03 09:40:58,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-03-03 09:40:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:40:58,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:58,932 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:58,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:40:59,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:59,136 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:59,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111663, now seen corresponding path program 5 times [2025-03-03 09:40:59,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:59,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129912106] [2025-03-03 09:40:59,136 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:59,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:59,144 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-03 09:40:59,155 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:40:59,155 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:40:59,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:40:59,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:59,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129912106] [2025-03-03 09:40:59,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129912106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:59,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759875245] [2025-03-03 09:40:59,212 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:59,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:59,214 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:59,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:40:59,258 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-03 09:40:59,281 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:40:59,281 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:40:59,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:59,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:40:59,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:40:59,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:40:59,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759875245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:59,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:59,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-03 09:40:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208254869] [2025-03-03 09:40:59,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:59,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:40:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:59,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:40:59,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:40:59,370 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:59,456 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-03-03 09:40:59,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:40:59,456 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-03 09:40:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:59,457 INFO L225 Difference]: With dead ends: 58 [2025-03-03 09:40:59,457 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 09:40:59,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:40:59,457 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:59,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 29 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 09:40:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2025-03-03 09:40:59,462 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-03 09:40:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-03 09:40:59,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-03-03 09:40:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:59,463 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-03 09:40:59,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-03 09:40:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:40:59,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:59,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:59,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:59,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:59,664 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:59,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1507597259, now seen corresponding path program 6 times [2025-03-03 09:40:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:59,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571360977] [2025-03-03 09:40:59,664 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:40:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:59,670 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 4 equivalence classes. [2025-03-03 09:40:59,680 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:40:59,680 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 09:40:59,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:40:59,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:59,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571360977] [2025-03-03 09:40:59,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571360977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:59,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854259278] [2025-03-03 09:40:59,745 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:40:59,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:59,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:59,747 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:59,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:40:59,787 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 4 equivalence classes. [2025-03-03 09:40:59,809 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:40:59,810 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 09:40:59,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:59,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:40:59,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:40:59,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:40:59,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854259278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:59,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:59,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:40:59,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241173750] [2025-03-03 09:40:59,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:59,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:40:59,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:59,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:40:59,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:40:59,922 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:00,005 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-03 09:41:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:41:00,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:41:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:00,006 INFO L225 Difference]: With dead ends: 31 [2025-03-03 09:41:00,006 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 09:41:00,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:41:00,006 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:00,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 37 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:41:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 09:41:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-03 09:41:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-03 09:41:00,011 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2025-03-03 09:41:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:00,012 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-03 09:41:00,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-03 09:41:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:41:00,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:00,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:00,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:41:00,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:41:00,213 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:00,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash 509156976, now seen corresponding path program 7 times [2025-03-03 09:41:00,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:00,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466668800] [2025-03-03 09:41:00,214 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:41:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:00,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:41:00,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:41:00,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:41:00,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:01,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:01,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466668800] [2025-03-03 09:41:01,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466668800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:01,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612062957] [2025-03-03 09:41:01,128 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:41:01,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:01,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:01,130 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:01,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:41:01,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:41:01,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:41:01,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:41:01,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:01,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-03 09:41:01,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:01,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:41:01,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:01,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:01,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:41:01,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:01,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-03 09:41:01,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:01,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:01,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:01,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:02,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 125 [2025-03-03 09:41:02,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:02,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 11753 treesize of output 11171 [2025-03-03 09:41:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:02,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612062957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:02,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:02,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 51 [2025-03-03 09:41:02,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498235750] [2025-03-03 09:41:02,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:02,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-03 09:41:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:02,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-03 09:41:02,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2277, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 09:41:02,416 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:03,088 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-03 09:41:03,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 09:41:03,088 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 09:41:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:03,088 INFO L225 Difference]: With dead ends: 56 [2025-03-03 09:41:03,088 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 09:41:03,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=380, Invalid=2926, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 09:41:03,089 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:03,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 118 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:41:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 09:41:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2025-03-03 09:41:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-03 09:41:03,095 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-03 09:41:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:03,096 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-03 09:41:03,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-03 09:41:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:41:03,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:03,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:03,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 09:41:03,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:03,297 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:03,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1298297487, now seen corresponding path program 2 times [2025-03-03 09:41:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022832071] [2025-03-03 09:41:03,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:41:03,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:03,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-03 09:41:03,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:41:03,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:41:03,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:41:03,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:03,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022832071] [2025-03-03 09:41:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022832071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:03,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434106769] [2025-03-03 09:41:03,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:41:03,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:03,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:03,484 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:03,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:41:03,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-03 09:41:03,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:41:03,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:41:03,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:03,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 09:41:03,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:03,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:41:03,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:03,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2025-03-03 09:41:03,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:03,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2025-03-03 09:41:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:41:03,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:03,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-03 09:41:03,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:41:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:41:03,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434106769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:03,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:03,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-03-03 09:41:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95783620] [2025-03-03 09:41:03,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:41:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:03,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:41:03,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:41:03,705 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:03,794 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-03-03 09:41:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:41:03,795 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 09:41:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:03,795 INFO L225 Difference]: With dead ends: 51 [2025-03-03 09:41:03,795 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 09:41:03,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:41:03,796 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:03,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 74 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:41:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 09:41:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-03 09:41:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-03 09:41:03,802 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2025-03-03 09:41:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:03,802 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-03 09:41:03,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-03 09:41:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:41:03,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:03,803 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:03,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:41:04,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:41:04,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:04,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2031421524, now seen corresponding path program 8 times [2025-03-03 09:41:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:04,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726597701] [2025-03-03 09:41:04,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:41:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:04,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-03 09:41:04,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:41:04,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:41:04,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:41:04,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:04,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726597701] [2025-03-03 09:41:04,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726597701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:04,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269420315] [2025-03-03 09:41:04,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:41:04,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:04,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:04,104 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:04,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:41:04,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-03 09:41:04,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:41:04,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:41:04,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:04,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:41:04,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:41:04,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:41:04,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269420315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:04,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:04,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-03 09:41:04,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456964490] [2025-03-03 09:41:04,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:04,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:41:04,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:04,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:41:04,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:41:04,275 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:04,422 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-03-03 09:41:04,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:41:04,422 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 09:41:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:04,423 INFO L225 Difference]: With dead ends: 53 [2025-03-03 09:41:04,423 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 09:41:04,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:41:04,423 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:04,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 29 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:41:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 09:41:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-03 09:41:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-03 09:41:04,431 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2025-03-03 09:41:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:04,431 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-03 09:41:04,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-03 09:41:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:41:04,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:04,431 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:04,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:41:04,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:41:04,634 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:04,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:04,634 INFO L85 PathProgramCache]: Analyzing trace with hash -433563119, now seen corresponding path program 3 times [2025-03-03 09:41:04,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:04,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891679517] [2025-03-03 09:41:04,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:41:04,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:04,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-03-03 09:41:04,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 29 statements. [2025-03-03 09:41:04,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:41:04,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:41:04,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:04,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891679517] [2025-03-03 09:41:04,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891679517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:04,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773720719] [2025-03-03 09:41:04,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:41:04,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:04,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:04,727 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:04,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:41:04,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-03-03 09:41:04,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 29 statements. [2025-03-03 09:41:04,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:41:04,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:04,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:41:04,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:41:04,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:41:04,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773720719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:04,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:04,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-03 09:41:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011350651] [2025-03-03 09:41:04,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:04,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:41:04,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:04,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:41:04,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:41:04,928 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:05,010 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-03-03 09:41:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:41:05,010 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 09:41:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:05,011 INFO L225 Difference]: With dead ends: 57 [2025-03-03 09:41:05,011 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 09:41:05,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:41:05,011 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:05,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 28 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:41:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 09:41:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-03 09:41:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-03-03 09:41:05,020 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2025-03-03 09:41:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:05,020 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-03-03 09:41:05,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-03-03 09:41:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:41:05,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:05,022 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:05,029 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-03 09:41:05,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:41:05,227 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:05,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1460355286, now seen corresponding path program 9 times [2025-03-03 09:41:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:05,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390628368] [2025-03-03 09:41:05,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:41:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:05,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-03-03 09:41:05,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:41:05,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:41:05,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:06,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:06,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390628368] [2025-03-03 09:41:06,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390628368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:06,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470950665] [2025-03-03 09:41:06,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:41:06,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:06,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:06,712 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:06,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:41:06,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-03-03 09:41:06,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:41:06,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:41:06,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:06,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-03 09:41:06,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:06,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:41:06,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:06,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:06,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:41:07,068 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2025-03-03 09:41:07,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 41 [2025-03-03 09:41:07,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:07,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:07,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:07,269 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2025-03-03 09:41:07,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 51 [2025-03-03 09:41:07,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:07,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:07,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:07,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:07,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 58 [2025-03-03 09:41:07,686 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 3 [2025-03-03 09:41:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:07,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:08,574 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 205 treesize of output 191 [2025-03-03 09:41:08,659 INFO L349 Elim1Store]: treesize reduction 40, result has 71.2 percent of original size [2025-03-03 09:41:08,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 89396 treesize of output 86907 [2025-03-03 09:41:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:09,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470950665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:09,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:09,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 64 [2025-03-03 09:41:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564993150] [2025-03-03 09:41:09,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:09,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-03 09:41:09,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:09,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-03 09:41:09,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=3441, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 09:41:09,848 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 64 states, 64 states have (on average 1.15625) internal successors, (74), 64 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-03 09:41:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:16,019 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2025-03-03 09:41:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-03 09:41:16,020 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.15625) internal successors, (74), 64 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 30 [2025-03-03 09:41:16,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:16,020 INFO L225 Difference]: With dead ends: 105 [2025-03-03 09:41:16,020 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 09:41:16,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4879 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2355, Invalid=12897, Unknown=0, NotChecked=0, Total=15252 [2025-03-03 09:41:16,023 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 83 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:16,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 131 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 09:41:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 09:41:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2025-03-03 09:41:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2025-03-03 09:41:16,047 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 30 [2025-03-03 09:41:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:16,047 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-03-03 09:41:16,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.15625) internal successors, (74), 64 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-03 09:41:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2025-03-03 09:41:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:41:16,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:16,048 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:16,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:41:16,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:41:16,248 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:16,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1263841781, now seen corresponding path program 4 times [2025-03-03 09:41:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:16,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816803633] [2025-03-03 09:41:16,249 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:41:16,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:16,254 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-03 09:41:16,260 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 30 statements. [2025-03-03 09:41:16,260 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:41:16,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:41:16,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:16,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816803633] [2025-03-03 09:41:16,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816803633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:16,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952624163] [2025-03-03 09:41:16,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:41:16,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:16,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:16,433 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:16,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:41:16,489 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-03 09:41:16,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 30 statements. [2025-03-03 09:41:16,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:41:16,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:16,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 09:41:16,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:16,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-03 09:41:16,559 INFO L349 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2025-03-03 09:41:16,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2025-03-03 09:41:16,634 INFO L349 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2025-03-03 09:41:16,634 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 4 case distinctions, treesize of input 50 treesize of output 58 [2025-03-03 09:41:16,778 INFO L349 Elim1Store]: treesize reduction 91, result has 33.1 percent of original size [2025-03-03 09:41:16,778 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 9 case distinctions, treesize of input 73 treesize of output 86 [2025-03-03 09:41:16,941 INFO L349 Elim1Store]: treesize reduction 33, result has 23.3 percent of original size [2025-03-03 09:41:16,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 60 treesize of output 43 [2025-03-03 09:41:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:41:17,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:41:17,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952624163] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:17,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:17,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 22 [2025-03-03 09:41:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729913422] [2025-03-03 09:41:17,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 09:41:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:17,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 09:41:17,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:41:17,100 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:17,517 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2025-03-03 09:41:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:41:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-03 09:41:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:17,518 INFO L225 Difference]: With dead ends: 87 [2025-03-03 09:41:17,518 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 09:41:17,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 09:41:17,519 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:17,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 32 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:41:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 09:41:17,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2025-03-03 09:41:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 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-03 09:41:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2025-03-03 09:41:17,541 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 30 [2025-03-03 09:41:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:17,541 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2025-03-03 09:41:17,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2025-03-03 09:41:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:41:17,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:17,543 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:17,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 09:41:17,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:17,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:17,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1754667662, now seen corresponding path program 10 times [2025-03-03 09:41:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:17,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649438680] [2025-03-03 09:41:17,744 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:41:17,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:17,750 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:41:17,760 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:41:17,761 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:41:17,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:41:17,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:17,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649438680] [2025-03-03 09:41:17,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649438680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:17,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972131234] [2025-03-03 09:41:17,856 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:41:17,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:17,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:17,857 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:17,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:41:17,928 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:41:17,986 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:41:17,986 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:41:17,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:17,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:41:17,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:41:18,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:41:18,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972131234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:18,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:18,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-03 09:41:18,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331989553] [2025-03-03 09:41:18,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:18,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:41:18,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:18,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:41:18,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:41:18,136 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-03 09:41:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:18,336 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2025-03-03 09:41:18,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:41:18,336 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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 31 [2025-03-03 09:41:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:18,337 INFO L225 Difference]: With dead ends: 100 [2025-03-03 09:41:18,337 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 09:41:18,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2025-03-03 09:41:18,338 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:18,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 22 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:41:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 09:41:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2025-03-03 09:41:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-03-03 09:41:18,353 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 31 [2025-03-03 09:41:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:18,353 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-03-03 09:41:18,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-03 09:41:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-03-03 09:41:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:41:18,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:18,353 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:18,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 09:41:18,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 09:41:18,555 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:18,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:18,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1051859978, now seen corresponding path program 11 times [2025-03-03 09:41:18,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:18,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057027266] [2025-03-03 09:41:18,555 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:41:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:18,562 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 5 equivalence classes. [2025-03-03 09:41:18,569 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:41:18,570 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:41:18,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:41:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057027266] [2025-03-03 09:41:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057027266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837625440] [2025-03-03 09:41:18,659 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:41:18,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:18,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:18,661 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:18,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 09:41:18,723 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 5 equivalence classes. [2025-03-03 09:41:18,833 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:41:18,834 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:41:18,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:18,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:41:18,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:41:18,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:41:18,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837625440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:18,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:18,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-03-03 09:41:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729068344] [2025-03-03 09:41:18,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:18,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 09:41:18,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:18,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 09:41:18,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:41:18,965 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:19,176 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2025-03-03 09:41:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:41:19,176 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 09:41:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:19,177 INFO L225 Difference]: With dead ends: 109 [2025-03-03 09:41:19,177 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 09:41:19,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:41:19,177 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 57 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:19,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 33 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:41:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 09:41:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-03-03 09:41:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 63 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2025-03-03 09:41:19,202 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 32 [2025-03-03 09:41:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:19,203 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2025-03-03 09:41:19,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2025-03-03 09:41:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:41:19,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:19,204 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:19,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 09:41:19,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:41:19,405 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:19,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash -255642448, now seen corresponding path program 12 times [2025-03-03 09:41:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:19,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340848535] [2025-03-03 09:41:19,405 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:41:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:19,411 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-03-03 09:41:19,428 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:41:19,429 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 09:41:19,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:21,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:21,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340848535] [2025-03-03 09:41:21,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340848535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:21,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275558274] [2025-03-03 09:41:21,175 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:41:21,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:21,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:21,177 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:21,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:41:21,236 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-03-03 09:41:21,302 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:41:21,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 09:41:21,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:21,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-03-03 09:41:21,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:21,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:41:21,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:21,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:21,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:41:21,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:21,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-03 09:41:21,894 INFO L349 Elim1Store]: treesize reduction 60, result has 36.2 percent of original size [2025-03-03 09:41:21,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 55 [2025-03-03 09:41:22,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,099 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2025-03-03 09:41:22,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 55 treesize of output 61 [2025-03-03 09:41:22,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:22,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:22,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:22,643 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-03 09:41:22,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:41:22,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:22,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 82 treesize of output 116 [2025-03-03 09:41:22,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 156 treesize of output 105 [2025-03-03 09:41:22,878 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 51 treesize of output 39 [2025-03-03 09:41:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:22,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:24,384 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 258 treesize of output 242 [2025-03-03 09:41:24,491 INFO L349 Elim1Store]: treesize reduction 60, result has 67.9 percent of original size [2025-03-03 09:41:24,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 800064 treesize of output 789916 [2025-03-03 09:41:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:26,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275558274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:26,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:26,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 85 [2025-03-03 09:41:26,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035962910] [2025-03-03 09:41:26,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:26,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2025-03-03 09:41:26,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:26,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2025-03-03 09:41:26,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1019, Invalid=6121, Unknown=0, NotChecked=0, Total=7140 [2025-03-03 09:41:26,092 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 85 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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-03 09:41:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:31,436 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2025-03-03 09:41:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-03 09:41:31,437 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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) Word has length 35 [2025-03-03 09:41:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:31,437 INFO L225 Difference]: With dead ends: 87 [2025-03-03 09:41:31,437 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 09:41:31,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4797 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2224, Invalid=12538, Unknown=0, NotChecked=0, Total=14762 [2025-03-03 09:41:31,440 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 116 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:31,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 128 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 09:41:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 09:41:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-03-03 09:41:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 66 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-03 09:41:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2025-03-03 09:41:31,463 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 35 [2025-03-03 09:41:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:31,463 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2025-03-03 09:41:31,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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-03 09:41:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2025-03-03 09:41:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:41:31,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:31,464 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:31,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-03 09:41:31,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:31,665 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:31,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash -761201073, now seen corresponding path program 5 times [2025-03-03 09:41:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017194477] [2025-03-03 09:41:31,665 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:41:31,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:31,672 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-03 09:41:31,684 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:41:31,684 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:41:31,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:41:31,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:31,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017194477] [2025-03-03 09:41:31,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017194477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:31,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264901761] [2025-03-03 09:41:31,937 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:41:31,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:31,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:31,940 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:31,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 09:41:32,012 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-03 09:41:32,129 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:41:32,129 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:41:32,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:32,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 09:41:32,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:32,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-03 09:41:32,163 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-03-03 09:41:32,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-03-03 09:41:32,223 INFO L349 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2025-03-03 09:41:32,223 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 4 case distinctions, treesize of input 38 treesize of output 36 [2025-03-03 09:41:32,266 INFO L349 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2025-03-03 09:41:32,267 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 4 case distinctions, treesize of input 42 treesize of output 38 [2025-03-03 09:41:32,313 INFO L349 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2025-03-03 09:41:32,313 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 4 case distinctions, treesize of input 42 treesize of output 38 [2025-03-03 09:41:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:41:32,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:32,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-03 09:41:32,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-03-03 09:41:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:41:32,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264901761] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:32,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:32,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2025-03-03 09:41:32,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912914822] [2025-03-03 09:41:32,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:32,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:41:32,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:32,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:41:32,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:41:32,379 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:32,534 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2025-03-03 09:41:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:41:32,535 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 09:41:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:32,535 INFO L225 Difference]: With dead ends: 81 [2025-03-03 09:41:32,535 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 09:41:32,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:41:32,536 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:32,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:41:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 09:41:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-03 09:41:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-03-03 09:41:32,549 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2025-03-03 09:41:32,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:32,549 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-03 09:41:32,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-03-03 09:41:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:41:32,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:32,550 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:32,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-03 09:41:32,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:32,750 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:32,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1537975375, now seen corresponding path program 13 times [2025-03-03 09:41:32,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:32,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26735497] [2025-03-03 09:41:32,753 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:41:32,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:32,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:41:32,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:41:32,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:41:32,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 09:41:32,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:32,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26735497] [2025-03-03 09:41:32,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26735497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:32,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074863733] [2025-03-03 09:41:32,920 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:41:32,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:32,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:32,922 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:32,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 09:41:32,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:41:33,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:41:33,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:41:33,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:33,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:41:33,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 09:41:33,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 09:41:33,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074863733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:33,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:33,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-03-03 09:41:33,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373815511] [2025-03-03 09:41:33,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:33,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:41:33,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:33,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:41:33,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:41:33,200 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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-03 09:41:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:33,324 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-03-03 09:41:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:41:33,325 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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 39 [2025-03-03 09:41:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:33,325 INFO L225 Difference]: With dead ends: 49 [2025-03-03 09:41:33,325 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 09:41:33,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:41:33,326 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 83 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:33,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 29 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:41:33,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 09:41:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-03-03 09:41:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-03 09:41:33,340 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 39 [2025-03-03 09:41:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:33,340 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-03 09:41:33,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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-03 09:41:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-03 09:41:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:41:33,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:33,340 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:33,347 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-03 09:41:33,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:33,541 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:33,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 432628118, now seen corresponding path program 14 times [2025-03-03 09:41:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:33,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693933147] [2025-03-03 09:41:33,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:41:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:33,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-03 09:41:33,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:41:33,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:41:33,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:35,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:35,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693933147] [2025-03-03 09:41:35,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693933147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:35,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097652294] [2025-03-03 09:41:35,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:41:35,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:35,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:35,387 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:35,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 09:41:35,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-03 09:41:35,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:41:35,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:41:35,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:35,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-03-03 09:41:35,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:35,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:41:35,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:35,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:35,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-03 09:41:35,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:35,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-03 09:41:35,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:35,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-03-03 09:41:36,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:36,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 51 [2025-03-03 09:41:36,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:36,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2025-03-03 09:41:36,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:36,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:36,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:36,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:36,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:36,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:41:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:36,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:38,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 410 treesize of output 386 [2025-03-03 09:41:39,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:39,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 1474854698778 treesize of output 1451232378927 [2025-03-03 09:41:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097652294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:41,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:41,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 93 [2025-03-03 09:41:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308236800] [2025-03-03 09:41:41,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:41,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-03-03 09:41:41,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:41,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-03-03 09:41:41,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=7898, Unknown=0, NotChecked=0, Total=8556 [2025-03-03 09:41:41,545 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 93 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:43,088 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2025-03-03 09:41:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-03 09:41:43,088 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 09:41:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:43,088 INFO L225 Difference]: With dead ends: 90 [2025-03-03 09:41:43,088 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 09:41:43,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3355 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=760, Invalid=8942, Unknown=0, NotChecked=0, Total=9702 [2025-03-03 09:41:43,091 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 43 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:43,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 159 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 09:41:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 09:41:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2025-03-03 09:41:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2025-03-03 09:41:43,108 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 40 [2025-03-03 09:41:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:43,108 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2025-03-03 09:41:43,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2025-03-03 09:41:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:41:43,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:43,109 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:43,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-03 09:41:43,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 09:41:43,309 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:43,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:43,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1940179927, now seen corresponding path program 6 times [2025-03-03 09:41:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:43,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-03 09:41:43,310 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:41:43,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:43,317 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 7 equivalence classes. [2025-03-03 09:41:43,341 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:41:43,341 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:41:43,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 10 proven. 58 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:41:43,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:43,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-03 09:41:43,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266031602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:43,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469945819] [2025-03-03 09:41:43,717 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:41:43,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:43,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:43,719 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:43,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 09:41:43,787 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 7 equivalence classes. [2025-03-03 09:41:43,901 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:41:43,901 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:41:43,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:43,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-03 09:41:43,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:43,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:41:43,990 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-03 09:41:43,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-03-03 09:41:44,085 INFO L349 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2025-03-03 09:41:44,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 44 [2025-03-03 09:41:44,264 INFO L349 Elim1Store]: treesize reduction 100, result has 44.8 percent of original size [2025-03-03 09:41:44,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 88 treesize of output 134 [2025-03-03 09:41:46,652 INFO L349 Elim1Store]: treesize reduction 1076, result has 21.3 percent of original size [2025-03-03 09:41:46,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 1 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 134 case distinctions, treesize of input 407 treesize of output 550