./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs3.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/brs3.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 c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:33:47,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:33:47,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:33:47,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:33:47,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:33:48,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:33:48,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:33:48,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:33:48,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:33:48,013 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:33:48,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:33:48,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:33:48,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:33:48,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:33:48,013 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:33:48,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:33:48,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:33:48,013 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:33:48,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:33:48,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:33:48,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:33:48,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:33:48,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:33:48,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:33:48,015 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 -> c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 [2025-03-03 09:33:48,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:33:48,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:33:48,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:33:48,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:33:48,249 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:33:48,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs3.c [2025-03-03 09:33:49,414 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9de57c58/e2cfc2ee11ea4aed83fba86e0ffd7601/FLAGab9164ba7 [2025-03-03 09:33:49,635 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:33:49,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c [2025-03-03 09:33:49,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9de57c58/e2cfc2ee11ea4aed83fba86e0ffd7601/FLAGab9164ba7 [2025-03-03 09:33:49,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9de57c58/e2cfc2ee11ea4aed83fba86e0ffd7601 [2025-03-03 09:33:49,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:33:49,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:33:49,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:33:49,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:33:49,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:33:49,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29af79c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49, skipping insertion in model container [2025-03-03 09:33:49,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:33:49,790 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/brs3.c[587,600] [2025-03-03 09:33:49,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:33:49,815 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:33:49,823 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/brs3.c[587,600] [2025-03-03 09:33:49,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:33:49,836 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:33:49,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49 WrapperNode [2025-03-03 09:33:49,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:33:49,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:33:49,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:33:49,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:33:49,842 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:33:49" (1/1) ... [2025-03-03 09:33:49,848 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:33:49" (1/1) ... [2025-03-03 09:33:49,859 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2025-03-03 09:33:49,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:33:49,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:33:49,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:33:49,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:33:49,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,874 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 7, 4, 3]. 44 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2025-03-03 09:33:49,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:33:49,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:33:49,882 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:33:49,882 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:33:49,883 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (1/1) ... [2025-03-03 09:33:49,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:33:49,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:49,906 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:33:49,909 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:33:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:33:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:33:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:33:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:33:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 09:33:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:33:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:33:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:33:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:33:49,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 09:33:49,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 09:33:49,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:33:49,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:33:49,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:33:49,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:33:49,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:33:49,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 09:33:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:33:49,997 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:33:49,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:33:50,141 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:33:50,148 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:33:50,148 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:33:50,156 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:33:50,157 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:33:50,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:33:50 BoogieIcfgContainer [2025-03-03 09:33:50,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:33:50,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:33:50,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:33:50,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:33:50,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:33:49" (1/3) ... [2025-03-03 09:33:50,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519d8d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:33:50, skipping insertion in model container [2025-03-03 09:33:50,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:49" (2/3) ... [2025-03-03 09:33:50,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519d8d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:33:50, skipping insertion in model container [2025-03-03 09:33:50,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:33:50" (3/3) ... [2025-03-03 09:33:50,166 INFO L128 eAbstractionObserver]: Analyzing ICFG brs3.c [2025-03-03 09:33:50,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:33:50,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG brs3.c that has 1 procedures, 18 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:33:50,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:33:50,228 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d476e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:33:50,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:33:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 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:33:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 09:33:50,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:50,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:50,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:50,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1883979954, now seen corresponding path program 1 times [2025-03-03 09:33:50,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:50,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524355234] [2025-03-03 09:33:50,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:50,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 09:33:50,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 09:33:50,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:50,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:50,355 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:33:50,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:50,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524355234] [2025-03-03 09:33:50,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524355234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:33:50,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:33:50,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:33:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265316583] [2025-03-03 09:33:50,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:33:50,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:33:50,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:50,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:33:50,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:33:50,371 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:50,378 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-03 09:33:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:33:50,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 09:33:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:50,383 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:33:50,383 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 09:33:50,388 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:33:50,390 INFO L435 NwaCegarLoop]: 22 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, 22 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:33:50,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 09:33:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-03 09:33:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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:33:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-03-03 09:33:50,413 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2025-03-03 09:33:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:50,414 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-03-03 09:33:50,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2025-03-03 09:33:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 09:33:50,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:50,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:50,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:33:50,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:50,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1912609105, now seen corresponding path program 1 times [2025-03-03 09:33:50,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:50,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087000729] [2025-03-03 09:33:50,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:50,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 09:33:50,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 09:33:50,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:50,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:50,585 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:33:50,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:50,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087000729] [2025-03-03 09:33:50,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087000729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:33:50,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:33:50,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:33:50,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761077981] [2025-03-03 09:33:50,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:33:50,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:33:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:50,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:33:50,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:33:50,590 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:50,644 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2025-03-03 09:33:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:33:50,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 09:33:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:50,646 INFO L225 Difference]: With dead ends: 29 [2025-03-03 09:33:50,646 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 09:33:50,647 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:33:50,647 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:50,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 09:33:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-03 09:33:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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:33:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-03-03 09:33:50,651 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2025-03-03 09:33:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:50,651 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-03 09:33:50,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-03-03 09:33:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 09:33:50,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:50,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:50,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:33:50,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:50,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:50,653 INFO L85 PathProgramCache]: Analyzing trace with hash 82669488, now seen corresponding path program 1 times [2025-03-03 09:33:50,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:50,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823301369] [2025-03-03 09:33:50,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:50,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:33:50,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:33:50,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:50,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:33:50,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:50,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823301369] [2025-03-03 09:33:50,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823301369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:33:50,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:33:50,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:33:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263081028] [2025-03-03 09:33:50,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:33:50,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:33:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:50,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:33:50,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:33:50,926 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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:33:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:50,973 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-03 09:33:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:33:50,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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:33:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:50,973 INFO L225 Difference]: With dead ends: 24 [2025-03-03 09:33:50,973 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 09:33:50,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:33:50,974 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:50,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 09:33:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-03 09:33:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-03 09:33:50,980 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2025-03-03 09:33:50,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:50,980 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-03 09:33:50,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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:33:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-03 09:33:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:33:50,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:50,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:50,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:33:50,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:50,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:50,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1909717652, now seen corresponding path program 1 times [2025-03-03 09:33:50,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:50,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928584801] [2025-03-03 09:33:50,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:50,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:50,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:33:51,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:33:51,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:51,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:51,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:51,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928584801] [2025-03-03 09:33:51,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928584801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:51,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550222030] [2025-03-03 09:33:51,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:51,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:51,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:51,107 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:33:51,109 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:33:51,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:33:51,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:33:51,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:51,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:51,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:33:51,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:51,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:51,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550222030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:51,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:51,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 09:33:51,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167722548] [2025-03-03 09:33:51,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:51,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:33:51,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:51,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:33:51,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:33:51,302 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 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:33:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:51,379 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2025-03-03 09:33:51,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:33:51,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 09:33:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:51,380 INFO L225 Difference]: With dead ends: 39 [2025-03-03 09:33:51,380 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 09:33:51,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:33:51,381 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:51,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:33:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 09:33:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-03-03 09:33:51,383 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:33:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-03 09:33:51,383 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2025-03-03 09:33:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:51,386 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-03 09:33:51,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 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:33:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-03 09:33:51,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:33:51,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:51,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:51,393 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:33:51,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:51,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:51,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -402987183, now seen corresponding path program 1 times [2025-03-03 09:33:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:51,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655796512] [2025-03-03 09:33:51,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:51,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 09:33:51,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:33:51,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:51,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655796512] [2025-03-03 09:33:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655796512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949657457] [2025-03-03 09:33:52,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:52,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:52,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:52,097 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:33:52,098 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:33:52,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 09:33:52,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:33:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:52,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 09:33:52,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:52,210 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 1 [2025-03-03 09:33:52,265 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:33:52,350 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:33:52,354 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 19 treesize of output 11 [2025-03-03 09:33:52,407 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 15 treesize of output 7 [2025-03-03 09:33:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:52,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:52,544 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 20 treesize of output 18 [2025-03-03 09:33:52,547 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 28 treesize of output 24 [2025-03-03 09:33:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:52,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949657457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:52,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:52,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2025-03-03 09:33:52,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401939186] [2025-03-03 09:33:52,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:52,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:33:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:52,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:33:52,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:33:52,603 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:52,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:52,799 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2025-03-03 09:33:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:33:52,800 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-03 09:33:52,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:52,800 INFO L225 Difference]: With dead ends: 45 [2025-03-03 09:33:52,800 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 09:33:52,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:33:52,801 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:52,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 60 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:33:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 09:33:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-03 09:33:52,805 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:33:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-03 09:33:52,807 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2025-03-03 09:33:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:52,807 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-03 09:33:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-03 09:33:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:33:52,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:52,807 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:52,814 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:33:53,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:53,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:53,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash -838315181, now seen corresponding path program 2 times [2025-03-03 09:33:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:53,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414070686] [2025-03-03 09:33:53,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:53,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:53,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 09:33:53,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:33:53,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:53,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:53,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:53,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414070686] [2025-03-03 09:33:53,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414070686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:53,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716020992] [2025-03-03 09:33:53,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:53,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:53,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:53,120 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:33:53,122 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:33:53,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 09:33:53,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:33:53,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:53,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:53,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:33:53,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:53,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:53,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716020992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:53,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:53,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-03 09:33:53,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340989391] [2025-03-03 09:33:53,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:53,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:33:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:53,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:33:53,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:33:53,270 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 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:33:53,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:53,362 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-03-03 09:33:53,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:33:53,363 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:33:53,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:53,363 INFO L225 Difference]: With dead ends: 57 [2025-03-03 09:33:53,363 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 09:33:53,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:33:53,364 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:53,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:33:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 09:33:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-03 09:33:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 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:33:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-03 09:33:53,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 24 [2025-03-03 09:33:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:53,368 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-03 09:33:53,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 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:33:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-03 09:33:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:33:53,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:53,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:53,374 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:33:53,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:53,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:53,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:53,573 INFO L85 PathProgramCache]: Analyzing trace with hash -599261616, now seen corresponding path program 3 times [2025-03-03 09:33:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379061130] [2025-03-03 09:33:53,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:33:53,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:53,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-03 09:33:53,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:33:53,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:33:53,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:54,495 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:33:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379061130] [2025-03-03 09:33:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379061130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525995389] [2025-03-03 09:33:54,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:33:54,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:54,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:54,499 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:33:54,500 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:33:54,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-03 09:33:54,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:33:54,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:33:54,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:54,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 09:33:54,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:54,592 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 19 treesize of output 1 [2025-03-03 09:33:54,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:33:54,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2025-03-03 09:33:54,806 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:33:54,899 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:33:55,040 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2025-03-03 09:33:55,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 37 [2025-03-03 09:33:55,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-03 09:33:55,141 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 15 treesize of output 7 [2025-03-03 09:33:55,164 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:33:55,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:55,672 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 37 treesize of output 33 [2025-03-03 09:33:55,679 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 47 treesize of output 39 [2025-03-03 09:33:55,686 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:33:55,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525995389] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:55,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:55,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 48 [2025-03-03 09:33:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620564297] [2025-03-03 09:33:55,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:55,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 09:33:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:55,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 09:33:55,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1915, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 09:33:55,688 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:57,363 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2025-03-03 09:33:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-03 09:33:57,363 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 09:33:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:57,364 INFO L225 Difference]: With dead ends: 71 [2025-03-03 09:33:57,364 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 09:33:57,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=963, Invalid=5357, Unknown=0, NotChecked=0, Total=6320 [2025-03-03 09:33:57,367 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 129 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:57,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 84 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:33:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 09:33:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 35. [2025-03-03 09:33:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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:33:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-03 09:33:57,373 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2025-03-03 09:33:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:57,373 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-03 09:33:57,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-03 09:33:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:33:57,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:57,375 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:57,382 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:33:57,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:57,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:57,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1695508468, now seen corresponding path program 4 times [2025-03-03 09:33:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17816034] [2025-03-03 09:33:57,576 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:33:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:57,587 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-03 09:33:57,595 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:33:57,595 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:33:57,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:57,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:57,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17816034] [2025-03-03 09:33:57,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17816034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:57,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761258388] [2025-03-03 09:33:57,766 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:33:57,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:57,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:57,768 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:33:57,769 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:33:57,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-03 09:33:57,816 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:33:57,817 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:33:57,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:57,818 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 09:33:57,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:57,824 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:33:57,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-03-03 09:33:57,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2025-03-03 09:33:58,037 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:33:58,132 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:33:58,228 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 53 treesize of output 30 [2025-03-03 09:33:58,433 INFO L349 Elim1Store]: treesize reduction 26, result has 70.1 percent of original size [2025-03-03 09:33:58,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 85 treesize of output 92 [2025-03-03 09:33:58,444 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 38 treesize of output 15 [2025-03-03 09:33:58,555 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 15 treesize of output 7 [2025-03-03 09:33:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:58,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761258388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:59,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:59,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 20] total 48 [2025-03-03 09:33:59,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301238084] [2025-03-03 09:33:59,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:59,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 09:33:59,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:59,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 09:33:59,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2009, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 09:33:59,168 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 48 states, 48 states have (on average 1.5625) internal successors, (75), 48 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:34:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:04,992 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2025-03-03 09:34:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-03-03 09:34:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.5625) internal successors, (75), 48 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-03 09:34:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:04,994 INFO L225 Difference]: With dead ends: 165 [2025-03-03 09:34:04,994 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 09:34:04,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8362 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3117, Invalid=22323, Unknown=0, NotChecked=0, Total=25440 [2025-03-03 09:34:04,998 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 252 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:04,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 149 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:34:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 09:34:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 63. [2025-03-03 09:34:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 62 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-03-03 09:34:05,015 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 30 [2025-03-03 09:34:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:05,015 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-03-03 09:34:05,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.5625) internal successors, (75), 48 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:34:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-03-03 09:34:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 09:34:05,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:05,016 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:05,023 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:34:05,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:05,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1464688459, now seen corresponding path program 5 times [2025-03-03 09:34:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671368264] [2025-03-03 09:34:05,217 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:34:05,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:05,224 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 6 equivalence classes. [2025-03-03 09:34:05,239 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 15 of 36 statements. [2025-03-03 09:34:05,239 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:34:05,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 09:34:05,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:05,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671368264] [2025-03-03 09:34:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671368264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:34:05,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:34:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 09:34:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284659695] [2025-03-03 09:34:05,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:34:05,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:34:05,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:05,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:34:05,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:34:05,411 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:34:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:05,467 INFO L93 Difference]: Finished difference Result 123 states and 149 transitions. [2025-03-03 09:34:05,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:34:05,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 36 [2025-03-03 09:34:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:05,468 INFO L225 Difference]: With dead ends: 123 [2025-03-03 09:34:05,470 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 09:34:05,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:34:05,470 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:05,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:34:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 09:34:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2025-03-03 09:34:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-03-03 09:34:05,488 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 36 [2025-03-03 09:34:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:05,488 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-03-03 09:34:05,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:34:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-03-03 09:34:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 09:34:05,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:05,490 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:05,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:34:05,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:05,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:05,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1621855571, now seen corresponding path program 6 times [2025-03-03 09:34:05,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:05,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177582914] [2025-03-03 09:34:05,491 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:34:05,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:05,496 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 6 equivalence classes. [2025-03-03 09:34:05,525 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:34:05,528 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 09:34:05,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:05,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:05,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177582914] [2025-03-03 09:34:05,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177582914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:34:05,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017595850] [2025-03-03 09:34:05,648 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:34:05,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:05,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:05,650 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:34:05,652 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:34:05,692 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 6 equivalence classes. [2025-03-03 09:34:05,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:34:05,724 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 09:34:05,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:05,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:34:05,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:05,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:05,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017595850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:05,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:05,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-03 09:34:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106002867] [2025-03-03 09:34:05,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:05,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:34:05,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:05,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:34:05,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:34:05,896 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:06,085 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2025-03-03 09:34:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:34:06,085 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 09:34:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:06,086 INFO L225 Difference]: With dead ends: 121 [2025-03-03 09:34:06,086 INFO L226 Difference]: Without dead ends: 118 [2025-03-03 09:34:06,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:34:06,087 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:06,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 40 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:34:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-03 09:34:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 51. [2025-03-03 09:34:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-03-03 09:34:06,099 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 36 [2025-03-03 09:34:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:06,099 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-03 09:34:06,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-03-03 09:34:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 09:34:06,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:06,100 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:06,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:34:06,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:06,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:06,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:06,301 INFO L85 PathProgramCache]: Analyzing trace with hash 816404466, now seen corresponding path program 7 times [2025-03-03 09:34:06,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:06,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183853399] [2025-03-03 09:34:06,301 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:34:06,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:06,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 09:34:06,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:34:06,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:34:06,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:06,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:06,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183853399] [2025-03-03 09:34:06,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183853399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:34:06,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18761788] [2025-03-03 09:34:06,408 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:34:06,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:06,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:06,410 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:34:06,411 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:34:06,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 09:34:06,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:34:06,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:34:06,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:06,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:34:06,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:06,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:06,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18761788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:06,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-03-03 09:34:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504784748] [2025-03-03 09:34:06,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:06,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:34:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:06,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:34:06,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:34:06,595 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:06,728 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2025-03-03 09:34:06,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:34:06,728 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 09:34:06,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:06,729 INFO L225 Difference]: With dead ends: 107 [2025-03-03 09:34:06,729 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 09:34:06,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:34:06,729 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:06,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 41 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:34:06,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 09:34:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2025-03-03 09:34:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-03-03 09:34:06,741 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 36 [2025-03-03 09:34:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:06,741 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-03-03 09:34:06,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-03-03 09:34:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:34:06,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:06,742 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:06,748 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:34:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:06,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:06,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:06,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1563503087, now seen corresponding path program 8 times [2025-03-03 09:34:06,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:06,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702740525] [2025-03-03 09:34:06,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:34:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:06,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 09:34:06,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:34:06,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:34:06,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:08,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702740525] [2025-03-03 09:34:08,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702740525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:34:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198122480] [2025-03-03 09:34:08,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:34:08,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:08,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:08,262 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:34:08,263 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:34:08,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 09:34:08,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:34:08,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:34:08,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:08,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-03 09:34:08,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:08,413 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 1 [2025-03-03 09:34:08,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:34:08,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:34:08,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:34:08,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-03 09:34:08,695 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:34:08,805 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:34:08,900 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 44 treesize of output 21 [2025-03-03 09:34:09,016 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 46 treesize of output 23 [2025-03-03 09:34:09,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 28 [2025-03-03 09:34:09,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:34:09,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 24 [2025-03-03 09:34:09,169 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 15 treesize of output 7 [2025-03-03 09:34:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:09,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:09,984 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 159 treesize of output 151 [2025-03-03 09:34:10,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:34:10,688 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 10675234550 treesize of output 10138363638 [2025-03-03 09:34:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:13,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198122480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:13,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 65 [2025-03-03 09:34:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025045920] [2025-03-03 09:34:13,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:13,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-03 09:34:13,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:13,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-03 09:34:13,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3756, Unknown=0, NotChecked=0, Total=4160 [2025-03-03 09:34:13,177 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 65 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 65 states have internal predecessors, (108), 0 states have call successors, (0), 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:34:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:15,573 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2025-03-03 09:34:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 09:34:15,574 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 65 states have internal predecessors, (108), 0 states have call successors, (0), 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:34:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:15,574 INFO L225 Difference]: With dead ends: 123 [2025-03-03 09:34:15,574 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 09:34:15,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2387 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=869, Invalid=7141, Unknown=0, NotChecked=0, Total=8010 [2025-03-03 09:34:15,576 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 121 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:15,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 116 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:34:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 09:34:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2025-03-03 09:34:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-03-03 09:34:15,590 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2025-03-03 09:34:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:15,591 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-03-03 09:34:15,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 65 states have internal predecessors, (108), 0 states have call successors, (0), 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:34:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-03-03 09:34:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 09:34:15,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:15,591 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:15,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:34:15,791 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,SelfDestructingSolverStorable11 [2025-03-03 09:34:15,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:15,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash 719121555, now seen corresponding path program 9 times [2025-03-03 09:34:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:15,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076450739] [2025-03-03 09:34:15,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:34:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:15,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 7 equivalence classes. [2025-03-03 09:34:15,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:34:15,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:34:15,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076450739] [2025-03-03 09:34:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076450739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:34:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142876284] [2025-03-03 09:34:16,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:34:16,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:16,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:16,019 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:34:16,028 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:34:16,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 7 equivalence classes. [2025-03-03 09:34:16,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:34:16,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:34:16,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:16,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:34:16,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:16,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:16,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142876284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:16,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:16,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2025-03-03 09:34:16,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484617182] [2025-03-03 09:34:16,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:16,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 09:34:16,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:16,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 09:34:16,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:34:16,458 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:16,781 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2025-03-03 09:34:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:34:16,781 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-03 09:34:16,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:16,782 INFO L225 Difference]: With dead ends: 96 [2025-03-03 09:34:16,782 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 09:34:16,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 66 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:34:16,783 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:16,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 38 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:34:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 09:34:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2025-03-03 09:34:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-03-03 09:34:16,796 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 42 [2025-03-03 09:34:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:16,796 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-03-03 09:34:16,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-03-03 09:34:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 09:34:16,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:16,796 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:16,803 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:34:17,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:34:17,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:17,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:17,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1716328306, now seen corresponding path program 10 times [2025-03-03 09:34:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:17,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910990204] [2025-03-03 09:34:17,001 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:34:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:17,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-03 09:34:17,017 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 45 statements. [2025-03-03 09:34:17,017 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:34:17,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:34:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910990204] [2025-03-03 09:34:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910990204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:34:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876809118] [2025-03-03 09:34:18,248 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:34:18,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:18,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:18,250 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:34:18,251 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:34:18,292 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-03 09:34:18,302 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 45 statements. [2025-03-03 09:34:18,302 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:34:18,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:18,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-03 09:34:18,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:18,321 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 23 treesize of output 1 [2025-03-03 09:34:18,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-03-03 09:34:18,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:34:18,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-03-03 09:34:18,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2025-03-03 09:34:18,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2025-03-03 09:34:18,810 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:34:18,936 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:34:19,080 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 48 treesize of output 25 [2025-03-03 09:34:19,229 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 56 treesize of output 33 [2025-03-03 09:34:19,386 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 63 treesize of output 40 [2025-03-03 09:34:19,758 INFO L349 Elim1Store]: treesize reduction 80, result has 60.2 percent of original size [2025-03-03 09:34:19,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 115 treesize of output 160 [2025-03-03 09:34:19,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2025-03-03 09:34:20,157 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 15 treesize of output 7 [2025-03-03 09:34:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:34:20,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 23 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:34:21,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876809118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:21,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:21,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28, 28] total 77 [2025-03-03 09:34:21,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406318426] [2025-03-03 09:34:21,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:21,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-03-03 09:34:21,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:21,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-03-03 09:34:21,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=5286, Unknown=0, NotChecked=0, Total=5852 [2025-03-03 09:34:21,968 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 77 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 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:34:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:29,695 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2025-03-03 09:34:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-03 09:34:29,696 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-03 09:34:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:29,696 INFO L225 Difference]: With dead ends: 104 [2025-03-03 09:34:29,696 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 09:34:29,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4863 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1896, Invalid=16464, Unknown=0, NotChecked=0, Total=18360 [2025-03-03 09:34:29,698 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 114 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:29,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 135 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 09:34:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 09:34:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 56. [2025-03-03 09:34:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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:34:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-03-03 09:34:29,715 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 45 [2025-03-03 09:34:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:29,715 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-03-03 09:34:29,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 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:34:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-03-03 09:34:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:34:29,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:29,716 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:29,722 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:34:29,916 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,SelfDestructingSolverStorable13 [2025-03-03 09:34:29,917 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:29,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:29,917 INFO L85 PathProgramCache]: Analyzing trace with hash -329833582, now seen corresponding path program 11 times [2025-03-03 09:34:29,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:29,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024894000] [2025-03-03 09:34:29,917 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:34:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:29,924 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 8 equivalence classes. [2025-03-03 09:34:29,948 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:34:29,948 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-03 09:34:29,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 59 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:30,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:30,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024894000] [2025-03-03 09:34:30,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024894000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:34:30,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961635092] [2025-03-03 09:34:30,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:34:30,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:30,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:30,130 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:34:30,132 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:34:30,174 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 8 equivalence classes. [2025-03-03 09:34:30,211 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:34:30,211 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-03 09:34:30,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:30,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:34:30,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:30,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 59 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961635092] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:30,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2025-03-03 09:34:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798375735] [2025-03-03 09:34:30,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:30,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:34:30,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:30,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:34:30,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:34:30,497 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:30,672 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2025-03-03 09:34:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:34:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 09:34:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:30,672 INFO L225 Difference]: With dead ends: 87 [2025-03-03 09:34:30,672 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 09:34:30,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 14 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2025-03-03 09:34:30,673 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 55 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:30,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 24 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:34:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 09:34:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-03-03 09:34:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-03-03 09:34:30,691 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 48 [2025-03-03 09:34:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:30,691 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-03-03 09:34:30,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-03-03 09:34:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 09:34:30,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:30,692 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:30,699 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:34:30,892 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,SelfDestructingSolverStorable14 [2025-03-03 09:34:30,893 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:30,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1958500976, now seen corresponding path program 12 times [2025-03-03 09:34:30,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:30,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820517981] [2025-03-03 09:34:30,893 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:34:30,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:30,900 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 8 equivalence classes. [2025-03-03 09:34:30,952 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:34:30,952 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-03 09:34:30,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 5 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:33,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:33,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820517981] [2025-03-03 09:34:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820517981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:34:33,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670315446] [2025-03-03 09:34:33,366 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:34:33,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:33,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:33,368 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:34:33,368 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:34:33,417 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 8 equivalence classes. [2025-03-03 09:34:33,541 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:34:33,542 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-03 09:34:33,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:33,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-03 09:34:33,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:33,606 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:34:33,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:34:33,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:34:33,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:34:33,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-03 09:34:33,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:33,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:33,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:33,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:33,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2025-03-03 09:34:34,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:34,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:34,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:34,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:34,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:34,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:34,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:34,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:34,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:34:34,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 64 [2025-03-03 09:34:34,257 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:34:34,406 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:34:34,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:34:34,718 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:34:34,882 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:34:34,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 0 case distinctions, treesize of input 48 treesize of output 25 [2025-03-03 09:34:35,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:35,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:35,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:35,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:35,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:35,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:35,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:35,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:35,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:34:35,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:34:35,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 17 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 92 treesize of output 136 [2025-03-03 09:34:35,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 39 treesize of output 16 [2025-03-03 09:34:35,650 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 15 [2025-03-03 09:34:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:35,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:38,512 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 197 treesize of output 189 [2025-03-03 09:34:38,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:34:38,938 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 699438055414 treesize of output 682258186230 [2025-03-03 09:34:44,953 WARN L286 SmtUtils]: Spent 5.98s on a formula simplification. DAG size of input: 16520 DAG size of output: 172 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 09:34:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:45,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670315446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:45,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:45,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31, 34] total 95 [2025-03-03 09:34:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479372267] [2025-03-03 09:34:45,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:45,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2025-03-03 09:34:45,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:45,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2025-03-03 09:34:45,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1172, Invalid=7758, Unknown=0, NotChecked=0, Total=8930 [2025-03-03 09:34:45,324 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 95 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 95 states have internal predecessors, (144), 0 states have call successors, (0), 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:34:53,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 09:34:59,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 09:35:03,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 09:35:20,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 09:35:22,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]