./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/brs4.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 727a45fc5966747e99c4394c0114e789db4ba39dd55af3d2c235925ac8282f92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:53:13,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:53:13,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:53:13,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:53:13,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:53:13,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:53:13,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:53:13,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:53:13,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:53:13,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:53:13,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:53:13,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:53:13,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:53:13,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:53:13,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:53:13,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:53:13,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:53:13,620 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:53:13,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:53:13,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:53:13,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:53:13,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:53:13,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:53:13,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:53:13,621 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:53:13,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:53:13,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:53:13,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:53:13,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:53:13,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:53:13,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:53:13,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:53:13,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:53:13,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:53:13,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:53:13,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:53:13,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:53:13,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:53:13,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:53:13,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:53:13,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:53:13,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:53:13,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:53:13,622 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 -> 727a45fc5966747e99c4394c0114e789db4ba39dd55af3d2c235925ac8282f92 [2025-03-16 13:53:13,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:53:13,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:53:13,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:53:13,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:53:13,853 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:53:13,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs4.c [2025-03-16 13:53:15,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80e43cc8/b2a90edcf92648e98788a4a1d58f848b/FLAG5f4cc48f2 [2025-03-16 13:53:15,247 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:53:15,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs4.c [2025-03-16 13:53:15,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80e43cc8/b2a90edcf92648e98788a4a1d58f848b/FLAG5f4cc48f2 [2025-03-16 13:53:15,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80e43cc8/b2a90edcf92648e98788a4a1d58f848b [2025-03-16 13:53:15,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:53:15,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:53:15,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:53:15,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:53:15,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:53:15,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba2bc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15, skipping insertion in model container [2025-03-16 13:53:15,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:53:15,707 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/brs4.c[587,600] [2025-03-16 13:53:15,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:53:15,729 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:53:15,737 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/brs4.c[587,600] [2025-03-16 13:53:15,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:53:15,758 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:53:15,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15 WrapperNode [2025-03-16 13:53:15,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:53:15,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:53:15,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:53:15,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:53:15,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,785 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2025-03-16 13:53:15,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:53:15,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:53:15,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:53:15,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:53:15,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,809 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-16 13:53:15,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,814 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:53:15,817 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:53:15,817 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:53:15,817 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:53:15,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (1/1) ... [2025-03-16 13:53:15,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:53:15,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:15,845 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-16 13:53:15,848 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-16 13:53:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:53:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:53:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:53:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 13:53:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 13:53:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:53:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:53:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:53:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 13:53:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 13:53:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 13:53:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:53:15,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:53:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:53:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:53:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 13:53:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 13:53:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:53:15,923 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:53:15,925 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:53:16,023 INFO L1322 $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-16 13:53:16,029 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 13:53:16,029 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:53:16,035 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:53:16,035 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:53:16,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:53:16 BoogieIcfgContainer [2025-03-16 13:53:16,035 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:53:16,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:53:16,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:53:16,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:53:16,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:53:15" (1/3) ... [2025-03-16 13:53:16,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733eaec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:53:16, skipping insertion in model container [2025-03-16 13:53:16,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:15" (2/3) ... [2025-03-16 13:53:16,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733eaec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:53:16, skipping insertion in model container [2025-03-16 13:53:16,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:53:16" (3/3) ... [2025-03-16 13:53:16,042 INFO L128 eAbstractionObserver]: Analyzing ICFG brs4.c [2025-03-16 13:53:16,052 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:53:16,053 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG brs4.c that has 1 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 13:53:16,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:53:16,098 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;@188a5fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:53:16,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:53:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 13:53:16,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:16,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:16,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:16,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:16,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1829669241, now seen corresponding path program 1 times [2025-03-16 13:53:16,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:16,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487588945] [2025-03-16 13:53:16,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:16,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:16,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 13:53:16,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 13:53:16,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:16,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:16,218 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-16 13:53:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487588945] [2025-03-16 13:53:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487588945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:53:16,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:53:16,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 13:53:16,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746689550] [2025-03-16 13:53:16,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:53:16,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 13:53:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:16,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 13:53:16,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 13:53:16,239 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:16,247 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-03-16 13:53:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 13:53:16,248 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-16 13:53:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:16,252 INFO L225 Difference]: With dead ends: 31 [2025-03-16 13:53:16,253 INFO L226 Difference]: Without dead ends: 13 [2025-03-16 13:53:16,257 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-16 13:53:16,259 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:16,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:53:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-16 13:53:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-16 13:53:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-03-16 13:53:16,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 8 [2025-03-16 13:53:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:16,281 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-16 13:53:16,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-03-16 13:53:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 13:53:16,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:16,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:16,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:53:16,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:16,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1858298392, now seen corresponding path program 1 times [2025-03-16 13:53:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:16,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178122967] [2025-03-16 13:53:16,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:16,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:16,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 13:53:16,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 13:53:16,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:16,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:16,423 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-16 13:53:16,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178122967] [2025-03-16 13:53:16,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178122967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:53:16,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:53:16,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:53:16,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328509232] [2025-03-16 13:53:16,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:53:16,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:53:16,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:16,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:53:16,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:53:16,425 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:16,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:16,479 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-03-16 13:53:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:53:16,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-16 13:53:16,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:16,480 INFO L225 Difference]: With dead ends: 28 [2025-03-16 13:53:16,480 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 13:53:16,481 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-16 13:53:16,481 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 10 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-16 13:53:16,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:53:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 13:53:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-16 13:53:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-03-16 13:53:16,484 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2025-03-16 13:53:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:16,484 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-03-16 13:53:16,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-03-16 13:53:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 13:53:16,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:16,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:16,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 13:53:16,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:16,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 51562295, now seen corresponding path program 1 times [2025-03-16 13:53:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:16,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671947295] [2025-03-16 13:53:16,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:16,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:16,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 13:53:16,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 13:53:16,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:16,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:16,716 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-16 13:53:16,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:16,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671947295] [2025-03-16 13:53:16,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671947295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:53:16,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:53:16,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 13:53:16,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331611445] [2025-03-16 13:53:16,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:53:16,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 13:53:16,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:16,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 13:53:16,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:53:16,718 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:16,760 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-03-16 13:53:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 13:53:16,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-16 13:53:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:16,762 INFO L225 Difference]: With dead ends: 23 [2025-03-16 13:53:16,762 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 13:53:16,762 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-16 13:53:16,763 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 26 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-16 13:53:16,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 26 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:53:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 13:53:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-03-16 13:53:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-16 13:53:16,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2025-03-16 13:53:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:16,768 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-16 13:53:16,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-03-16 13:53:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 13:53:16,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:16,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:16,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 13:53:16,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:16,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1386700371, now seen corresponding path program 1 times [2025-03-16 13:53:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379813828] [2025-03-16 13:53:16,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:16,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 13:53:16,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 13:53:16,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:16,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:16,873 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-16 13:53:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379813828] [2025-03-16 13:53:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379813828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:16,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087890868] [2025-03-16 13:53:16,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:16,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:16,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:16,879 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-16 13:53:16,882 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-16 13:53:16,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 13:53:16,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 13:53:16,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:16,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:16,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:53:16,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:17,031 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-16 13:53:17,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:17,087 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-16 13:53:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087890868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:17,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:17,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-16 13:53:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81759080] [2025-03-16 13:53:17,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:17,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 13:53:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:17,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 13:53:17,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 13:53:17,088 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:17,181 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-03-16 13:53:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 13:53:17,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-16 13:53:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:17,182 INFO L225 Difference]: With dead ends: 38 [2025-03-16 13:53:17,182 INFO L226 Difference]: Without dead ends: 26 [2025-03-16 13:53:17,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-16 13:53:17,183 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:17,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 27 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:53:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-16 13:53:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-03-16 13:53:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-16 13:53:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-16 13:53:17,189 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 17 [2025-03-16 13:53:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:17,189 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-16 13:53:17,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-16 13:53:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 13:53:17,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:17,190 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:17,197 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-16 13:53:17,395 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-16 13:53:17,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:17,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:17,396 INFO L85 PathProgramCache]: Analyzing trace with hash 434912664, now seen corresponding path program 1 times [2025-03-16 13:53:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:17,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455452470] [2025-03-16 13:53:17,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:17,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 13:53:17,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 13:53:17,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:17,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:17,868 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-16 13:53:17,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:17,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455452470] [2025-03-16 13:53:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455452470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:17,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650308341] [2025-03-16 13:53:17,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:17,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:17,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:17,870 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-16 13:53:17,873 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-16 13:53:17,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 13:53:17,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 13:53:17,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:17,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:17,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 13:53:17,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:17,976 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-16 13:53:18,033 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-16 13:53:18,106 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-16 13:53:18,110 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-16 13:53:18,155 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-16 13:53:18,184 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-16 13:53:18,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:18,294 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-16 13:53:18,298 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-16 13:53:18,350 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-16 13:53:18,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650308341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:18,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:18,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2025-03-16 13:53:18,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396432970] [2025-03-16 13:53:18,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:18,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 13:53:18,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:18,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 13:53:18,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-03-16 13:53:18,353 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:18,542 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2025-03-16 13:53:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 13:53:18,542 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-16 13:53:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:18,543 INFO L225 Difference]: With dead ends: 44 [2025-03-16 13:53:18,543 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 13:53:18,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 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-16 13:53:18,544 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:18,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:53:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 13:53:18,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-16 13:53:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-16 13:53:18,548 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2025-03-16 13:53:18,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:18,548 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-16 13:53:18,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-16 13:53:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 13:53:18,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:18,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:18,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 13:53:18,754 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-16 13:53:18,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:18,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:18,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1313897556, now seen corresponding path program 2 times [2025-03-16 13:53:18,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:18,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479064163] [2025-03-16 13:53:18,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:53:18,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:18,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-16 13:53:18,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:53:18,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:53:18,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:18,839 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-16 13:53:18,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:18,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479064163] [2025-03-16 13:53:18,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479064163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:18,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177342087] [2025-03-16 13:53:18,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:53:18,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:18,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:18,842 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-16 13:53:18,857 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-16 13:53:18,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-16 13:53:18,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:53:18,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:53:18,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:18,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:53:18,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:18,953 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-16 13:53:18,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:18,992 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-16 13:53:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177342087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:18,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:18,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-16 13:53:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365437315] [2025-03-16 13:53:18,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:18,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 13:53:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:18,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 13:53:18,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-16 13:53:18,994 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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-16 13:53:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:19,084 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-03-16 13:53:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 13:53:19,084 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-16 13:53:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:19,085 INFO L225 Difference]: With dead ends: 56 [2025-03-16 13:53:19,085 INFO L226 Difference]: Without dead ends: 34 [2025-03-16 13:53:19,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 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-16 13:53:19,086 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:19,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:53:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-16 13:53:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2025-03-16 13:53:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-16 13:53:19,100 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 23 [2025-03-16 13:53:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:19,100 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-16 13:53:19,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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-16 13:53:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-16 13:53:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 13:53:19,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:19,100 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:19,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 13:53:19,301 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-16 13:53:19,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:19,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:19,302 INFO L85 PathProgramCache]: Analyzing trace with hash 423314263, now seen corresponding path program 3 times [2025-03-16 13:53:19,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:19,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327078733] [2025-03-16 13:53:19,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:53:19,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:19,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-03-16 13:53:19,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 13:53:19,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:53:19,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:19,991 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-16 13:53:19,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327078733] [2025-03-16 13:53:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327078733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146936036] [2025-03-16 13:53:19,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:53:19,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:19,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:19,994 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-16 13:53:19,996 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-16 13:53:20,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-03-16 13:53:20,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 13:53:20,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:53:20,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:20,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 13:53:20,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:20,068 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-16 13:53:20,120 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-16 13:53:20,364 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-16 13:53:20,441 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-16 13:53:20,586 INFO L349 Elim1Store]: treesize reduction 8, result has 79.5 percent of original size [2025-03-16 13:53:20,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 57 [2025-03-16 13:53:20,592 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-16 13:53:20,724 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-16 13:53:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:53:20,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:53:21,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146936036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:21,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:21,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 42 [2025-03-16 13:53:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902898759] [2025-03-16 13:53:21,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:21,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-16 13:53:21,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:21,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-16 13:53:21,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 13:53:21,199 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:24,391 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2025-03-16 13:53:24,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-16 13:53:24,391 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-16 13:53:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:24,392 INFO L225 Difference]: With dead ends: 124 [2025-03-16 13:53:24,392 INFO L226 Difference]: Without dead ends: 99 [2025-03-16 13:53:24,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3347 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1867, Invalid=8639, Unknown=0, NotChecked=0, Total=10506 [2025-03-16 13:53:24,398 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 136 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:24,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 106 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 13:53:24,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-16 13:53:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2025-03-16 13:53:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 75 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2025-03-16 13:53:24,411 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 26 [2025-03-16 13:53:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:24,411 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2025-03-16 13:53:24,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2025-03-16 13:53:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 13:53:24,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:24,412 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:24,417 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-16 13:53:24,612 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-16 13:53:24,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:24,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1174004211, now seen corresponding path program 4 times [2025-03-16 13:53:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305962212] [2025-03-16 13:53:24,613 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:53:24,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:24,622 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-03-16 13:53:24,633 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-03-16 13:53:24,634 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 13:53:24,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:53:24,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305962212] [2025-03-16 13:53:24,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305962212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662389600] [2025-03-16 13:53:24,835 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:53:24,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:24,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:24,837 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-16 13:53:24,839 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-16 13:53:24,876 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-03-16 13:53:24,886 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-03-16 13:53:24,886 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 13:53:24,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:24,887 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-16 13:53:24,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:24,914 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-16 13:53:24,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-03-16 13:53:25,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:53:25,014 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-16 13:53:25,119 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-16 13:53:25,194 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-16 13:53:25,313 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-16 13:53:25,449 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-16 13:53:25,492 INFO L349 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-03-16 13:53:25,493 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 65 treesize of output 68 [2025-03-16 13:53:25,587 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-16 13:53:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 13:53:25,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 13:53:26,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662389600] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:26,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:26,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22, 20] total 50 [2025-03-16 13:53:26,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788733750] [2025-03-16 13:53:26,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:26,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-16 13:53:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:26,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-16 13:53:26,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=2084, Unknown=0, NotChecked=0, Total=2450 [2025-03-16 13:53:26,109 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 50 states, 50 states have (on average 1.62) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:28,324 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2025-03-16 13:53:28,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-03-16 13:53:28,324 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.62) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 13:53:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:28,326 INFO L225 Difference]: With dead ends: 207 [2025-03-16 13:53:28,326 INFO L226 Difference]: Without dead ends: 193 [2025-03-16 13:53:28,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4203 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2426, Invalid=11854, Unknown=0, NotChecked=0, Total=14280 [2025-03-16 13:53:28,330 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 191 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:28,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 124 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 13:53:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-16 13:53:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 93. [2025-03-16 13:53:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2025-03-16 13:53:28,346 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 35 [2025-03-16 13:53:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:28,347 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2025-03-16 13:53:28,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.62) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2025-03-16 13:53:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 13:53:28,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:28,348 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:28,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 13:53:28,552 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-16 13:53:28,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:28,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1976763059, now seen corresponding path program 5 times [2025-03-16 13:53:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:28,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854885141] [2025-03-16 13:53:28,552 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:53:28,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:28,559 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 7 equivalence classes. [2025-03-16 13:53:28,587 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 13:53:28,588 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-16 13:53:28,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:28,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:28,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854885141] [2025-03-16 13:53:28,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854885141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:28,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450120032] [2025-03-16 13:53:28,697 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:53:28,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:28,700 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-16 13:53:28,701 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-16 13:53:28,740 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 7 equivalence classes. [2025-03-16 13:53:28,765 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 13:53:28,766 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-16 13:53:28,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:28,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 13:53:28,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:28,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:28,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450120032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:28,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:28,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-03-16 13:53:28,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875456951] [2025-03-16 13:53:28,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:28,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 13:53:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:28,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 13:53:28,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-03-16 13:53:28,968 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:29,211 INFO L93 Difference]: Finished difference Result 290 states and 341 transitions. [2025-03-16 13:53:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 13:53:29,211 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 13:53:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:29,212 INFO L225 Difference]: With dead ends: 290 [2025-03-16 13:53:29,212 INFO L226 Difference]: Without dead ends: 169 [2025-03-16 13:53:29,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=483, Invalid=1409, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 13:53:29,213 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 91 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:29,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 33 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:53:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-16 13:53:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2025-03-16 13:53:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.184) internal successors, (148), 125 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 148 transitions. [2025-03-16 13:53:29,228 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 148 transitions. Word has length 35 [2025-03-16 13:53:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:29,228 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 148 transitions. [2025-03-16 13:53:29,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2025-03-16 13:53:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 13:53:29,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:29,229 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:29,235 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-16 13:53:29,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:29,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:29,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2029230068, now seen corresponding path program 6 times [2025-03-16 13:53:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:29,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020408590] [2025-03-16 13:53:29,430 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:53:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:29,437 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 7 equivalence classes. [2025-03-16 13:53:29,470 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 41 statements. [2025-03-16 13:53:29,470 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-16 13:53:29,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 13:53:29,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:29,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020408590] [2025-03-16 13:53:29,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020408590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:29,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48302578] [2025-03-16 13:53:29,640 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:53:29,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:29,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:29,641 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-16 13:53:29,643 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-16 13:53:29,683 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 7 equivalence classes. [2025-03-16 13:53:29,712 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 41 statements. [2025-03-16 13:53:29,713 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-16 13:53:29,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:29,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 13:53:29,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 25 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 13:53:29,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 13:53:30,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48302578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:30,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:30,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 20] total 30 [2025-03-16 13:53:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421891064] [2025-03-16 13:53:30,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:30,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 13:53:30,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:30,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 13:53:30,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2025-03-16 13:53:30,208 INFO L87 Difference]: Start difference. First operand 126 states and 148 transitions. Second operand has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:30,611 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2025-03-16 13:53:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 13:53:30,612 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-16 13:53:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:30,612 INFO L225 Difference]: With dead ends: 206 [2025-03-16 13:53:30,612 INFO L226 Difference]: Without dead ends: 92 [2025-03-16 13:53:30,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 13:53:30,613 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 133 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:30,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 42 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 13:53:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-16 13:53:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-03-16 13:53:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 90 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2025-03-16 13:53:30,626 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 41 [2025-03-16 13:53:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:30,626 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2025-03-16 13:53:30,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2025-03-16 13:53:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 13:53:30,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:30,626 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:30,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 13:53:30,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:30,827 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:30,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1076010089, now seen corresponding path program 7 times [2025-03-16 13:53:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:30,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75068797] [2025-03-16 13:53:30,828 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:53:30,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:30,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 13:53:30,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 13:53:30,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:30,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:32,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:32,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75068797] [2025-03-16 13:53:32,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75068797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:32,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155378159] [2025-03-16 13:53:32,428 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:53:32,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:32,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:32,430 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-16 13:53:32,431 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-16 13:53:32,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 13:53:32,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 13:53:32,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:32,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:32,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-16 13:53:32,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:32,511 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-16 13:53:32,552 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-16 13:53:32,609 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 30 treesize of output 21 [2025-03-16 13:53:32,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:53:32,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-16 13:53:32,793 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 44 treesize of output 41 [2025-03-16 13:53:32,884 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-16 13:53:32,979 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-16 13:53:33,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2025-03-16 13:53:33,167 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 50 treesize of output 27 [2025-03-16 13:53:33,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 28 [2025-03-16 13:53:33,424 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-16 13:53:33,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:53:33,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 28 [2025-03-16 13:53:33,468 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-16 13:53:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:33,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:34,814 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 237 treesize of output 227 [2025-03-16 13:53:38,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:53:38,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1604818163655670 treesize of output 1560837698544630 [2025-03-16 13:54:27,740 WARN L286 SmtUtils]: Spent 49.39s on a formula simplification. DAG size of input: 96654 DAG size of output: 98 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 13:54:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:54:28,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155378159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:54:28,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:54:28,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 74 [2025-03-16 13:54:28,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726307026] [2025-03-16 13:54:28,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:54:28,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-03-16 13:54:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:28,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-03-16 13:54:28,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=4821, Unknown=0, NotChecked=0, Total=5402 [2025-03-16 13:54:28,560 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 74 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 74 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:54:41,494 INFO L93 Difference]: Finished difference Result 157 states and 183 transitions. [2025-03-16 13:54:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-16 13:54:41,495 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 74 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 13:54:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:54:41,496 INFO L225 Difference]: With dead ends: 157 [2025-03-16 13:54:41,496 INFO L226 Difference]: Without dead ends: 101 [2025-03-16 13:54:41,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3310 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1159, Invalid=9347, Unknown=0, NotChecked=0, Total=10506 [2025-03-16 13:54:41,499 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 124 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:54:41,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 122 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-16 13:54:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-16 13:54:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 57. [2025-03-16 13:54:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 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-16 13:54:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-03-16 13:54:41,510 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 44 [2025-03-16 13:54:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:54:41,510 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-03-16 13:54:41,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 74 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-03-16 13:54:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 13:54:41,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:41,512 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:41,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 13:54:41,712 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,SelfDestructingSolverStorable10 [2025-03-16 13:54:41,712 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:41,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1956370099, now seen corresponding path program 8 times [2025-03-16 13:54:41,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:41,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968916181] [2025-03-16 13:54:41,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:54:41,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:41,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-16 13:54:41,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 13:54:41,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:54:41,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 54 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:54:42,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:54:42,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968916181] [2025-03-16 13:54:42,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968916181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:54:42,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635683096] [2025-03-16 13:54:42,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:54:42,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:42,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:54:42,640 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-16 13:54:42,641 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-16 13:54:42,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-16 13:54:42,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 13:54:42,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:54:42,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:42,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 13:54:42,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:54:44,005 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-16 13:54:44,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:54:44,817 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-16 13:54:44,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635683096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:54:44,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:54:44,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2025-03-16 13:54:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036886542] [2025-03-16 13:54:44,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:54:44,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 13:54:44,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:44,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 13:54:44,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2025-03-16 13:54:44,818 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 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-16 13:54:45,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:54:45,757 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2025-03-16 13:54:45,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 13:54:45,757 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 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 47 [2025-03-16 13:54:45,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:54:45,758 INFO L225 Difference]: With dead ends: 89 [2025-03-16 13:54:45,758 INFO L226 Difference]: Without dead ends: 64 [2025-03-16 13:54:45,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2025-03-16 13:54:45,759 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 46 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 13:54:45,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 21 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 13:54:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-16 13:54:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2025-03-16 13:54:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2025-03-16 13:54:45,768 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 47 [2025-03-16 13:54:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:54:45,768 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2025-03-16 13:54:45,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 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-16 13:54:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2025-03-16 13:54:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 13:54:45,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:45,769 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:45,775 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-16 13:54:45,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:45,969 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:45,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:45,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1703196778, now seen corresponding path program 9 times [2025-03-16 13:54:45,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:45,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830735523] [2025-03-16 13:54:45,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:54:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:45,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 8 equivalence classes. [2025-03-16 13:54:46,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 13:54:46,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-16 13:54:46,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat