./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/brs3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:53:10,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:53:10,973 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:10,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:53:10,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:53:10,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:53:11,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:53:11,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:53:11,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:53:11,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:53:11,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:53:11,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:53:11,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:53:11,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:53:11,002 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:53:11,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:53:11,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:53:11,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:53:11,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:53:11,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:53:11,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:53:11,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:53:11,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:53:11,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:53:11,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:53:11,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:53:11,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:53:11,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:53:11,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:53:11,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:53:11,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:53:11,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:53:11,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:53:11,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:53:11,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:53:11,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:53:11,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:53:11,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:53:11,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:53:11,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:53:11,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:53:11,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:53:11,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:53:11,006 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 [2025-03-16 13:53:11,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:53:11,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:53:11,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:53:11,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:53:11,221 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:53:11,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs3.c [2025-03-16 13:53:12,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f2ea41c/3cdc14fdc18f461dafb2a97f4fd3d174/FLAG14dae67f8 [2025-03-16 13:53:12,546 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:53:12,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c [2025-03-16 13:53:12,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f2ea41c/3cdc14fdc18f461dafb2a97f4fd3d174/FLAG14dae67f8 [2025-03-16 13:53:12,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f2ea41c/3cdc14fdc18f461dafb2a97f4fd3d174 [2025-03-16 13:53:12,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:53:12,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:53:12,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:53:12,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:53:12,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:53:12,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:53:12" (1/1) ... [2025-03-16 13:53:12,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c58411c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:12, skipping insertion in model container [2025-03-16 13:53:12,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:53:12" (1/1) ... [2025-03-16 13:53:12,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:53:12,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c[587,600] [2025-03-16 13:53:12,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:53:12,729 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:53:12,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c[587,600] [2025-03-16 13:53:12,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:53:12,756 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:53:12,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:12 WrapperNode [2025-03-16 13:53:12,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:53:12,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:53:12,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:53:12,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:53:12,762 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:12" (1/1) ... [2025-03-16 13:53:12,767 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:12" (1/1) ... [2025-03-16 13:53:12,779 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2025-03-16 13:53:12,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:53:12,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:53:12,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:53:12,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:53:12,784 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:12" (1/1) ... [2025-03-16 13:53:12,784 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:12" (1/1) ... [2025-03-16 13:53:12,790 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:12" (1/1) ... [2025-03-16 13:53:12,798 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:12,798 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:12" (1/1) ... [2025-03-16 13:53:12,798 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:12" (1/1) ... [2025-03-16 13:53:12,801 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:12" (1/1) ... [2025-03-16 13:53:12,802 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:12" (1/1) ... [2025-03-16 13:53:12,802 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:12" (1/1) ... [2025-03-16 13:53:12,803 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:12" (1/1) ... [2025-03-16 13:53:12,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:53:12,804 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:53:12,804 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:53:12,804 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:53:12,805 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:12" (1/1) ... [2025-03-16 13:53:12,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:53:12,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:12,826 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:12,830 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:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:53:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:53:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:53:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 13:53:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 13:53:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:53:12,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 13:53:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:53:12,902 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:53:12,905 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:53:13,049 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:13,053 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 13:53:13,053 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:53:13,060 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:53:13,061 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:53:13,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:53:13 BoogieIcfgContainer [2025-03-16 13:53:13,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:53:13,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:53:13,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:53:13,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:53:13,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:53:12" (1/3) ... [2025-03-16 13:53:13,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a7e5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:53:13, skipping insertion in model container [2025-03-16 13:53:13,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:53:12" (2/3) ... [2025-03-16 13:53:13,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a7e5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:53:13, skipping insertion in model container [2025-03-16 13:53:13,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:53:13" (3/3) ... [2025-03-16 13:53:13,070 INFO L128 eAbstractionObserver]: Analyzing ICFG brs3.c [2025-03-16 13:53:13,081 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:53:13,082 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG brs3.c that has 1 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 13:53:13,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:53:13,121 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;@7ad12cad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:53:13,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:53:13,124 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:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 13:53:13,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:13,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:13,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:13,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1829669241, now seen corresponding path program 1 times [2025-03-16 13:53:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:13,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335679530] [2025-03-16 13:53:13,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:13,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 13:53:13,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 13:53:13,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:13,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:13,246 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:13,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:13,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335679530] [2025-03-16 13:53:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335679530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:53:13,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:53:13,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 13:53:13,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727558265] [2025-03-16 13:53:13,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:53:13,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 13:53:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:13,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 13:53:13,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 13:53:13,267 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:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:13,274 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-03-16 13:53:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 13:53:13,275 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:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:13,280 INFO L225 Difference]: With dead ends: 31 [2025-03-16 13:53:13,280 INFO L226 Difference]: Without dead ends: 13 [2025-03-16 13:53:13,285 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:13,287 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:13,287 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:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-16 13:53:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-16 13:53:13,304 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:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-03-16 13:53:13,308 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 8 [2025-03-16 13:53:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:13,309 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-16 13:53:13,309 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:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-03-16 13:53:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 13:53:13,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:13,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:13,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:53:13,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:13,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1858298392, now seen corresponding path program 1 times [2025-03-16 13:53:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:13,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217067605] [2025-03-16 13:53:13,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:13,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 13:53:13,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 13:53:13,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:13,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:13,464 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:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:13,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217067605] [2025-03-16 13:53:13,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217067605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:53:13,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:53:13,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:53:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763761710] [2025-03-16 13:53:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:53:13,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:53:13,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:13,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:53:13,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:53:13,467 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:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:13,515 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-03-16 13:53:13,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:53:13,518 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:13,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:13,518 INFO L225 Difference]: With dead ends: 28 [2025-03-16 13:53:13,518 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 13:53:13,518 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:13,519 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:13,519 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:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 13:53:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-16 13:53:13,523 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:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-03-16 13:53:13,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2025-03-16 13:53:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:13,525 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-03-16 13:53:13,525 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:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-03-16 13:53:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 13:53:13,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:13,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:13,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 13:53:13,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:13,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash 51562295, now seen corresponding path program 1 times [2025-03-16 13:53:13,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:13,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176371622] [2025-03-16 13:53:13,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:13,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 13:53:13,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 13:53:13,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:13,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:13,789 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:13,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176371622] [2025-03-16 13:53:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176371622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:53:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:53:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 13:53:13,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519088514] [2025-03-16 13:53:13,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:53:13,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 13:53:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:13,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 13:53:13,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:53:13,792 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:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:13,840 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-03-16 13:53:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 13:53:13,841 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:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:13,841 INFO L225 Difference]: With dead ends: 23 [2025-03-16 13:53:13,841 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 13:53:13,842 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:13,842 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:13,842 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:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 13:53:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-03-16 13:53:13,844 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:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-16 13:53:13,845 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2025-03-16 13:53:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:13,846 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-16 13:53:13,847 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:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-03-16 13:53:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 13:53:13,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:13,847 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:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 13:53:13,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1386700371, now seen corresponding path program 1 times [2025-03-16 13:53:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158822839] [2025-03-16 13:53:13,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:13,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 13:53:13,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 13:53:13,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:13,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:13,982 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:13,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158822839] [2025-03-16 13:53:13,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158822839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315719675] [2025-03-16 13:53:13,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:13,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:13,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:13,993 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:13,994 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:14,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 13:53:14,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 13:53:14,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:14,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:14,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:53:14,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:14,145 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:14,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:14,188 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:14,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315719675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:14,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:14,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-16 13:53:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770703889] [2025-03-16 13:53:14,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:14,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 13:53:14,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:14,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 13:53:14,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 13:53:14,189 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:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:14,263 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-03-16 13:53:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 13:53:14,263 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:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:14,263 INFO L225 Difference]: With dead ends: 38 [2025-03-16 13:53:14,263 INFO L226 Difference]: Without dead ends: 26 [2025-03-16 13:53:14,264 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:14,264 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:14,264 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:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-16 13:53:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-03-16 13:53:14,270 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:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-16 13:53:14,270 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 17 [2025-03-16 13:53:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:14,271 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-16 13:53:14,271 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:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-16 13:53:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 13:53:14,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:14,271 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:14,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 13:53:14,471 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:14,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:14,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 434912664, now seen corresponding path program 1 times [2025-03-16 13:53:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564600351] [2025-03-16 13:53:14,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:14,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 13:53:14,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 13:53:14,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:14,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:14,969 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:14,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:14,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564600351] [2025-03-16 13:53:14,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564600351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:14,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140109148] [2025-03-16 13:53:14,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:53:14,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:14,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:14,973 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:14,974 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:15,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 13:53:15,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 13:53:15,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:15,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:15,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 13:53:15,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:15,079 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:15,132 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:15,205 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:15,208 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:15,259 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:15,286 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:15,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:15,399 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:15,403 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:15,456 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:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140109148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:15,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:15,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2025-03-16 13:53:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200197046] [2025-03-16 13:53:15,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:15,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 13:53:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:15,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 13:53:15,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-03-16 13:53:15,458 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:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:15,628 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2025-03-16 13:53:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 13:53:15,629 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:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:15,629 INFO L225 Difference]: With dead ends: 44 [2025-03-16 13:53:15,629 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 13:53:15,630 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:15,630 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:15,630 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:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 13:53:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-16 13:53:15,633 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:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-16 13:53:15,633 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2025-03-16 13:53:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:15,633 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-16 13:53:15,637 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:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-16 13:53:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 13:53:15,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:15,638 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:15,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 13:53:15,838 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:15,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:15,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1313897556, now seen corresponding path program 2 times [2025-03-16 13:53:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541084730] [2025-03-16 13:53:15,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:53:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:15,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-16 13:53:15,855 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:15,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:53:15,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:15,946 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:15,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541084730] [2025-03-16 13:53:15,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541084730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966031929] [2025-03-16 13:53:15,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:53:15,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:15,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:15,949 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:15,950 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:15,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-16 13:53:16,001 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:16,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:53:16,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:16,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:53:16,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:16,060 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:16,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:16,099 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:16,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966031929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:16,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:16,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-16 13:53:16,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031507202] [2025-03-16 13:53:16,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:16,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 13:53:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:16,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 13:53:16,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-16 13:53:16,101 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:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:16,193 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-03-16 13:53:16,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 13:53:16,194 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:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:16,194 INFO L225 Difference]: With dead ends: 56 [2025-03-16 13:53:16,194 INFO L226 Difference]: Without dead ends: 34 [2025-03-16 13:53:16,194 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:16,195 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:16,195 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:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-16 13:53:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2025-03-16 13:53:16,199 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:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-16 13:53:16,199 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 23 [2025-03-16 13:53:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:16,199 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-16 13:53:16,199 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:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-16 13:53:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 13:53:16,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:16,200 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:16,208 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:16,400 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:16,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:16,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash 423314263, now seen corresponding path program 3 times [2025-03-16 13:53:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:16,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701165088] [2025-03-16 13:53:16,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:53:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:16,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-03-16 13:53:16,449 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:16,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:53:16,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:17,199 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:17,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:17,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701165088] [2025-03-16 13:53:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701165088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:17,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759593103] [2025-03-16 13:53:17,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:53:17,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:17,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:17,202 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:17,203 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:17,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-03-16 13:53:17,252 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:17,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:53:17,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:17,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-16 13:53:17,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:17,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-16 13:53:17,431 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-16 13:53:17,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-03-16 13:53:17,618 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:17,739 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:17,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:17,926 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 13:53:17,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:17,927 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 13:53:17,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:53:17,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 33 [2025-03-16 13:53:17,937 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 34 treesize of output 11 [2025-03-16 13:53:17,997 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,014 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:18,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:18,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-16 13:53:18,447 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 20 treesize of output 16 [2025-03-16 13:53:18,496 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:18,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759593103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:18,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:18,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 48 [2025-03-16 13:53:18,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361744196] [2025-03-16 13:53:18,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:18,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-16 13:53:18,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:18,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-16 13:53:18,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1900, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 13:53:18,498 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 48 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 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:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:20,990 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2025-03-16 13:53:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-16 13:53:20,990 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 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 26 [2025-03-16 13:53:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:20,991 INFO L225 Difference]: With dead ends: 82 [2025-03-16 13:53:20,991 INFO L226 Difference]: Without dead ends: 55 [2025-03-16 13:53:20,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2942 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1568, Invalid=7552, Unknown=0, NotChecked=0, Total=9120 [2025-03-16 13:53:20,995 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:20,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 86 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 13:53:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-16 13:53:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2025-03-16 13:53:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 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:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-16 13:53:21,002 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 26 [2025-03-16 13:53:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:21,002 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-16 13:53:21,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 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:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-03-16 13:53:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 13:53:21,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:21,003 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:21,012 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:21,207 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:21,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:21,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1377352456, now seen corresponding path program 4 times [2025-03-16 13:53:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:21,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33312291] [2025-03-16 13:53:21,208 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:53:21,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:21,216 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-16 13:53:21,234 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 32 statements. [2025-03-16 13:53:21,234 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 13:53:21,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:53:21,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:21,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33312291] [2025-03-16 13:53:21,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33312291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:21,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008273492] [2025-03-16 13:53:21,997 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:53:21,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:21,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:21,999 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:22,001 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:22,035 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-16 13:53:22,043 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 32 statements. [2025-03-16 13:53:22,044 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 13:53:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:22,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-16 13:53:22,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:22,056 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:22,097 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:22,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2025-03-16 13:53:22,309 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:22,405 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:22,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 30 [2025-03-16 13:53:22,725 INFO L349 Elim1Store]: treesize reduction 26, result has 70.1 percent of original size [2025-03-16 13:53:22,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 85 treesize of output 92 [2025-03-16 13:53:22,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-03-16 13:53:22,918 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:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:53:22,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:53:23,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008273492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:23,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:23,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 54 [2025-03-16 13:53:23,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186080976] [2025-03-16 13:53:23,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:23,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-16 13:53:23,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:23,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-16 13:53:23,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=2570, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 13:53:23,629 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:32,371 INFO L93 Difference]: Finished difference Result 184 states and 226 transitions. [2025-03-16 13:53:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-03-16 13:53:32,371 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-16 13:53:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:32,373 INFO L225 Difference]: With dead ends: 184 [2025-03-16 13:53:32,373 INFO L226 Difference]: Without dead ends: 170 [2025-03-16 13:53:32,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8935 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3407, Invalid=24315, Unknown=0, NotChecked=0, Total=27722 [2025-03-16 13:53:32,378 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 211 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:32,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 102 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 13:53:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-16 13:53:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 102. [2025-03-16 13:53:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 101 states have internal predecessors, (126), 0 states have call successors, (0), 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:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2025-03-16 13:53:32,395 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 32 [2025-03-16 13:53:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:32,395 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2025-03-16 13:53:32,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2025-03-16 13:53:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 13:53:32,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:32,397 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:32,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 13:53:32,598 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:32,599 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:32,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1529790540, now seen corresponding path program 5 times [2025-03-16 13:53:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642357296] [2025-03-16 13:53:32,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:53:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:32,606 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-16 13:53:32,627 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 27 of 35 statements. [2025-03-16 13:53:32,627 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-16 13:53:32,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 13:53:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:32,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642357296] [2025-03-16 13:53:32,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642357296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:53:32,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:53:32,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 13:53:32,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963953913] [2025-03-16 13:53:32,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:53:32,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 13:53:32,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:32,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 13:53:32,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 13:53:32,841 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:32,885 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2025-03-16 13:53:32,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:53:32,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 13:53:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:32,886 INFO L225 Difference]: With dead ends: 168 [2025-03-16 13:53:32,886 INFO L226 Difference]: Without dead ends: 75 [2025-03-16 13:53:32,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:32,887 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:32,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:53:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-16 13:53:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2025-03-16 13:53:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 67 states have internal predecessors, (82), 0 states have call successors, (0), 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:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-03-16 13:53:32,904 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 35 [2025-03-16 13:53:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:32,904 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-03-16 13:53:32,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-03-16 13:53:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 13:53:32,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:32,905 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:32,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 13:53:32,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:32,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1179576310, now seen corresponding path program 6 times [2025-03-16 13:53:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:32,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75119832] [2025-03-16 13:53:32,906 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:53:32,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:32,912 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-03-16 13:53:32,928 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 29 of 35 statements. [2025-03-16 13:53:32,929 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-16 13:53:32,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 13:53:33,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:33,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75119832] [2025-03-16 13:53:33,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75119832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:33,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535992941] [2025-03-16 13:53:33,091 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:53:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:33,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:33,094 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:33,096 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:33,132 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-03-16 13:53:33,151 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 29 of 35 statements. [2025-03-16 13:53:33,151 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-16 13:53:33,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:33,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 13:53:33,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 29 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 13:53:33,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 13:53:33,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535992941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:33,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:33,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 28 [2025-03-16 13:53:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465380032] [2025-03-16 13:53:33,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:33,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 13:53:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:33,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 13:53:33,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2025-03-16 13:53:33,429 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:33,971 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2025-03-16 13:53:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-16 13:53:33,971 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 13:53:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:33,972 INFO L225 Difference]: With dead ends: 161 [2025-03-16 13:53:33,972 INFO L226 Difference]: Without dead ends: 99 [2025-03-16 13:53:33,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=699, Invalid=2607, Unknown=0, NotChecked=0, Total=3306 [2025-03-16 13:53:33,973 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 107 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:33,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 58 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 13:53:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-16 13:53:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2025-03-16 13:53:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.155844155844156) internal successors, (89), 77 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:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2025-03-16 13:53:33,991 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 35 [2025-03-16 13:53:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:33,992 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2025-03-16 13:53:33,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2025-03-16 13:53:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 13:53:33,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:33,993 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:33,999 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:34,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:34,194 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:34,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1318439627, now seen corresponding path program 7 times [2025-03-16 13:53:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:34,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099336755] [2025-03-16 13:53:34,195 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:53:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:34,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 13:53:34,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 13:53:34,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:34,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099336755] [2025-03-16 13:53:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099336755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048123658] [2025-03-16 13:53:34,302 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:53:34,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:34,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:34,304 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:34,306 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:34,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 13:53:34,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 13:53:34,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:53:34,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:34,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 13:53:34,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:34,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:34,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048123658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:34,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:34,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-03-16 13:53:34,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186247413] [2025-03-16 13:53:34,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:34,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 13:53:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:34,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 13:53:34,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-16 13:53:34,513 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:34,621 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2025-03-16 13:53:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 13:53:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 13:53:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:34,622 INFO L225 Difference]: With dead ends: 123 [2025-03-16 13:53:34,622 INFO L226 Difference]: Without dead ends: 87 [2025-03-16 13:53:34,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-03-16 13:53:34,622 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 37 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:34,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:53:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-16 13:53:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2025-03-16 13:53:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.15) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2025-03-16 13:53:34,641 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 35 [2025-03-16 13:53:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:34,641 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2025-03-16 13:53:34,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2025-03-16 13:53:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 13:53:34,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:34,642 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:53:34,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 13:53:34,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:34,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:34,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash -510146408, now seen corresponding path program 8 times [2025-03-16 13:53:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647601970] [2025-03-16 13:53:34,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:53:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:34,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-16 13:53:34,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 13:53:34,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:53:34,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:36,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:36,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647601970] [2025-03-16 13:53:36,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647601970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:36,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696923187] [2025-03-16 13:53:36,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:53:36,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:36,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:36,035 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:36,037 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:36,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-16 13:53:36,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 13:53:36,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:53:36,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:36,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-16 13:53:36,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:36,105 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:36,150 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:36,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:53:36,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-16 13:53:36,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-16 13:53:36,341 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:36,443 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:36,529 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:36,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 23 [2025-03-16 13:53:36,745 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:36,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:53:36,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 24 [2025-03-16 13:53:36,784 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:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:36,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:53:37,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 151 [2025-03-16 13:53:37,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:53:37,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 344777942 treesize of output 328000726 [2025-03-16 13:53:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696923187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:53:38,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:53:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 63 [2025-03-16 13:53:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443066244] [2025-03-16 13:53:38,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:53:38,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-16 13:53:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:53:38,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-16 13:53:38,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=3466, Unknown=0, NotChecked=0, Total=3906 [2025-03-16 13:53:38,676 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 63 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 63 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:53:40,402 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2025-03-16 13:53:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-16 13:53:40,402 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 63 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-16 13:53:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:53:40,403 INFO L225 Difference]: With dead ends: 127 [2025-03-16 13:53:40,403 INFO L226 Difference]: Without dead ends: 83 [2025-03-16 13:53:40,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2325 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=875, Invalid=6607, Unknown=0, NotChecked=0, Total=7482 [2025-03-16 13:53:40,404 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 99 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 13:53:40,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 123 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 13:53:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-16 13:53:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2025-03-16 13:53:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-03-16 13:53:40,417 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 38 [2025-03-16 13:53:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:53:40,417 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-03-16 13:53:40,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 63 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:53:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-03-16 13:53:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 13:53:40,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:53:40,418 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:40,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 13:53:40,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 13:53:40,618 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:53:40,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:53:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash -125712199, now seen corresponding path program 9 times [2025-03-16 13:53:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:53:40,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737522170] [2025-03-16 13:53:40,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:53:40,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:53:40,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 7 equivalence classes. [2025-03-16 13:53:40,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 13:53:40,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 13:53:40,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:42,172 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:42,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:53:42,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737522170] [2025-03-16 13:53:42,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737522170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:53:42,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107986701] [2025-03-16 13:53:42,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:53:42,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:53:42,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:53:42,175 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:53:42,176 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:53:42,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 7 equivalence classes. [2025-03-16 13:53:42,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 13:53:42,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 13:53:42,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:53:42,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-16 13:53:42,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:53:42,315 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:42,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:42,365 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 27 treesize of output 11 [2025-03-16 13:53:42,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:42,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:42,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:53:42,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-16 13:53:42,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:42,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:42,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:42,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2025-03-16 13:53:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:42,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:42,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:42,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:42,666 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 60 treesize of output 53 [2025-03-16 13:53:48,344 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:52,334 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:53,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 23 [2025-03-16 13:53:54,044 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:54,230 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 65 treesize of output 42 [2025-03-16 13:53:58,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:53:58,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:53:58,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 26 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 118 treesize of output 180 [2025-03-16 13:53:58,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2025-03-16 13:53:58,834 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:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 10 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:53:58,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:54:00,162 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 41 treesize of output 37 [2025-03-16 13:54:00,165 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 55 treesize of output 47 [2025-03-16 13:54:00,255 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:00,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107986701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:54:00,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:54:00,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 32] total 85 [2025-03-16 13:54:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383553604] [2025-03-16 13:54:00,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:54:00,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2025-03-16 13:54:00,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:00,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2025-03-16 13:54:00,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=888, Invalid=6246, Unknown=6, NotChecked=0, Total=7140 [2025-03-16 13:54:00,257 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 85 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 0 states have call successors, (0), 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:19,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:54:23,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:54:32,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:54:40,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:54:45,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]