./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array15_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array15_pattern.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 511c1484167d1d7d90ff27dae8a1569edd7c5a72fd917e4f05baeab770e0fcd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:37:24,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:37:24,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:37:24,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:37:24,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:37:24,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:37:24,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:37:24,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:37:24,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:37:24,781 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:37:24,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:37:24,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:37:24,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:37:24,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:37:24,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:37:24,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:37:24,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:37:24,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:37:24,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:37:24,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:37:24,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:37:24,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:37:24,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:37:24,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:37:24,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:37:24,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:37:24,784 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 -> 511c1484167d1d7d90ff27dae8a1569edd7c5a72fd917e4f05baeab770e0fcd4 [2025-03-08 00:37:25,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:37:25,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:37:25,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:37:25,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:37:25,012 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:37:25,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array15_pattern.c [2025-03-08 00:37:26,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a01ad71e/97442e91488c4ee9b95d9152b31d6b33/FLAG563e0d7c6 [2025-03-08 00:37:26,270 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:37:26,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array15_pattern.c [2025-03-08 00:37:26,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a01ad71e/97442e91488c4ee9b95d9152b31d6b33/FLAG563e0d7c6 [2025-03-08 00:37:26,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a01ad71e/97442e91488c4ee9b95d9152b31d6b33 [2025-03-08 00:37:26,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:37:26,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:37:26,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:37:26,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:37:26,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:37:26,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26, skipping insertion in model container [2025-03-08 00:37:26,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:37:26,753 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-patterns/array15_pattern.c[1424,1437] [2025-03-08 00:37:26,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:37:26,778 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:37:26,785 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-patterns/array15_pattern.c[1424,1437] [2025-03-08 00:37:26,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:37:26,808 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:37:26,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26 WrapperNode [2025-03-08 00:37:26,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:37:26,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:37:26,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:37:26,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:37:26,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,829 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2025-03-08 00:37:26,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:37:26,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:37:26,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:37:26,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:37:26,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,842 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-08 00:37:26,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,845 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:37:26,851 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:37:26,852 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:37:26,852 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:37:26,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (1/1) ... [2025-03-08 00:37:26,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:37:26,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:26,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:37:26,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:37:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:37:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 00:37:26,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 00:37:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:37:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:37:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:37:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:37:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:37:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:37:26,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:37:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:37:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:37:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:37:26,933 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:37:26,934 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:37:27,033 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-03-08 00:37:27,044 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 00:37:27,044 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:37:27,050 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:37:27,050 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:37:27,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:37:27 BoogieIcfgContainer [2025-03-08 00:37:27,050 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:37:27,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:37:27,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:37:27,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:37:27,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:37:26" (1/3) ... [2025-03-08 00:37:27,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2ee0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:37:27, skipping insertion in model container [2025-03-08 00:37:27,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:26" (2/3) ... [2025-03-08 00:37:27,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2ee0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:37:27, skipping insertion in model container [2025-03-08 00:37:27,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:37:27" (3/3) ... [2025-03-08 00:37:27,057 INFO L128 eAbstractionObserver]: Analyzing ICFG array15_pattern.c [2025-03-08 00:37:27,067 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:37:27,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array15_pattern.c that has 2 procedures, 27 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 00:37:27,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:37:27,104 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;@3101be61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:37:27,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:37:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:37:27,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:27,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:27,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:27,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash 72201478, now seen corresponding path program 1 times [2025-03-08 00:37:27,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:27,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883177098] [2025-03-08 00:37:27,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:27,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:27,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:37:27,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:37:27,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:27,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:37:27,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883177098] [2025-03-08 00:37:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883177098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:37:27,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:37:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:37:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279764809] [2025-03-08 00:37:27,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:37:27,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:37:27,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:27,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:37:27,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:37:27,226 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 00:37:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:27,236 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2025-03-08 00:37:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:37:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-08 00:37:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:27,241 INFO L225 Difference]: With dead ends: 51 [2025-03-08 00:37:27,241 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:37:27,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:37:27,245 INFO L435 NwaCegarLoop]: 34 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, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:27,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:37:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:37:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 00:37:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-03-08 00:37:27,268 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2025-03-08 00:37:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:27,268 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-08 00:37:27,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 00:37:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-03-08 00:37:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:37:27,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:27,269 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:27,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:37:27,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:27,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:27,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1810271204, now seen corresponding path program 1 times [2025-03-08 00:37:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:27,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189982985] [2025-03-08 00:37:27,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:27,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:27,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 00:37:27,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:37:27,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:27,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:37:27,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189982985] [2025-03-08 00:37:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189982985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991091923] [2025-03-08 00:37:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:27,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:27,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:27,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:27,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:37:27,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 00:37:27,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:37:27,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:27,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:27,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:37:27,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:37:27,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:37:27,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991091923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:37:27,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:37:27,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 00:37:27,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138393008] [2025-03-08 00:37:27,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:37:27,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:37:27,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:27,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:37:27,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:37:27,664 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:37:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:27,723 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-03-08 00:37:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:37:27,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-08 00:37:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:27,725 INFO L225 Difference]: With dead ends: 53 [2025-03-08 00:37:27,726 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 00:37:27,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:37:27,726 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:27,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 00:37:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2025-03-08 00:37:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-08 00:37:27,733 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 28 [2025-03-08 00:37:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:27,734 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-08 00:37:27,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:37:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-08 00:37:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:37:27,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:27,735 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:27,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:27,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:27,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:27,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash 867838138, now seen corresponding path program 1 times [2025-03-08 00:37:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:27,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551181854] [2025-03-08 00:37:27,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:27,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:27,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:37:27,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:37:27,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:27,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:37:28,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:28,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551181854] [2025-03-08 00:37:28,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551181854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:37:28,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:37:28,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:37:28,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509586622] [2025-03-08 00:37:28,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:37:28,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:37:28,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:28,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:37:28,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:37:28,033 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:37:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:28,077 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2025-03-08 00:37:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:37:28,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-08 00:37:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:28,078 INFO L225 Difference]: With dead ends: 48 [2025-03-08 00:37:28,078 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 00:37:28,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:37:28,079 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:28,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:37:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 00:37:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-08 00:37:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-08 00:37:28,084 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 30 [2025-03-08 00:37:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:28,084 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-08 00:37:28,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:37:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-08 00:37:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:37:28,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:28,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:28,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:37:28,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:28,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1000978392, now seen corresponding path program 1 times [2025-03-08 00:37:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:28,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118097548] [2025-03-08 00:37:28,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:28,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:37:28,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:37:28,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:28,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:37:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118097548] [2025-03-08 00:37:28,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118097548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350314425] [2025-03-08 00:37:28,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:28,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:28,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:28,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:28,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:37:28,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:37:28,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:37:28,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:28,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:28,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:37:28,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:37:28,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:37:28,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350314425] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:28,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-08 00:37:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447502774] [2025-03-08 00:37:28,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:28,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:37:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:28,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:37:28,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:37:28,385 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:37:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:28,514 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2025-03-08 00:37:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:37:28,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 31 [2025-03-08 00:37:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:28,515 INFO L225 Difference]: With dead ends: 36 [2025-03-08 00:37:28,515 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 00:37:28,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:37:28,516 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:28,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 98 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 00:37:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-08 00:37:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-08 00:37:28,525 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 31 [2025-03-08 00:37:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:28,526 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-08 00:37:28,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:37:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-08 00:37:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:37:28,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:28,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:28,533 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-08 00:37:28,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 00:37:28,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:28,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:28,732 INFO L85 PathProgramCache]: Analyzing trace with hash 279048524, now seen corresponding path program 1 times [2025-03-08 00:37:28,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:28,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296928748] [2025-03-08 00:37:28,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:28,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:37:28,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:37:28,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:28,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:37:28,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:28,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296928748] [2025-03-08 00:37:28,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296928748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:28,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197078276] [2025-03-08 00:37:28,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:28,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:28,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:28,926 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:28,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:37:28,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:37:28,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:37:28,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:28,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:28,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:37:28,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:37:29,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:37:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197078276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:29,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:29,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 25 [2025-03-08 00:37:29,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60372753] [2025-03-08 00:37:29,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:29,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:37:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:29,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:37:29,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:37:29,386 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 25 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 18 states have internal predecessors, (42), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 00:37:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:29,905 INFO L93 Difference]: Finished difference Result 127 states and 169 transitions. [2025-03-08 00:37:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 00:37:29,906 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 18 states have internal predecessors, (42), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 34 [2025-03-08 00:37:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:29,907 INFO L225 Difference]: With dead ends: 127 [2025-03-08 00:37:29,907 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 00:37:29,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=310, Invalid=1330, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 00:37:29,909 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:29,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 219 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:37:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 00:37:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2025-03-08 00:37:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:37:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2025-03-08 00:37:29,918 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 34 [2025-03-08 00:37:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:29,918 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2025-03-08 00:37:29,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 18 states have internal predecessors, (42), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 00:37:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2025-03-08 00:37:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:37:29,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:29,919 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:29,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:30,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:30,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:30,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:30,120 INFO L85 PathProgramCache]: Analyzing trace with hash 82535019, now seen corresponding path program 1 times [2025-03-08 00:37:30,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:30,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490528469] [2025-03-08 00:37:30,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:30,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:37:30,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:37:30,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:30,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:37:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929048248] [2025-03-08 00:37:30,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:30,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:30,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:30,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:30,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:37:30,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:37:30,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:37:30,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:30,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:30,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 00:37:30,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:30,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:37:30,576 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-03-08 00:37:30,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2025-03-08 00:37:30,653 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-08 00:37:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:37:30,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490528469] [2025-03-08 00:37:31,037 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:37:31,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929048248] [2025-03-08 00:37:31,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929048248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:31,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:37:31,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2025-03-08 00:37:31,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716742179] [2025-03-08 00:37:31,038 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:31,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 00:37:31,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:31,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 00:37:31,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:37:31,039 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:31,345 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2025-03-08 00:37:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:37:31,345 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.25) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2025-03-08 00:37:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:31,346 INFO L225 Difference]: With dead ends: 113 [2025-03-08 00:37:31,346 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 00:37:31,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 00:37:31,347 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:31,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 129 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:37:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 00:37:31,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2025-03-08 00:37:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 77 states have internal predecessors, (101), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:37:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 119 transitions. [2025-03-08 00:37:31,363 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 119 transitions. Word has length 34 [2025-03-08 00:37:31,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:31,363 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 119 transitions. [2025-03-08 00:37:31,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.25) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 119 transitions. [2025-03-08 00:37:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:37:31,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:31,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:31,370 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-08 00:37:31,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:31,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:31,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1735426437, now seen corresponding path program 2 times [2025-03-08 00:37:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391144629] [2025-03-08 00:37:31,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:31,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:31,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-08 00:37:31,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:37:31,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:31,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:37:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:31,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391144629] [2025-03-08 00:37:31,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391144629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:31,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881015514] [2025-03-08 00:37:31,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:31,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:31,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:31,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:31,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:37:31,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-08 00:37:31,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:37:31,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:31,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:31,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:37:31,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:37:31,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:37:31,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881015514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:31,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:31,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:37:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220321485] [2025-03-08 00:37:31,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:31,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:37:31,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:31,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:37:31,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:37:31,777 INFO L87 Difference]: Start difference. First operand 91 states and 119 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:31,863 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2025-03-08 00:37:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:37:31,864 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-03-08 00:37:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:31,865 INFO L225 Difference]: With dead ends: 134 [2025-03-08 00:37:31,865 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 00:37:31,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:37:31,865 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:31,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 105 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 00:37:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2025-03-08 00:37:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 77 states have internal predecessors, (97), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:37:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2025-03-08 00:37:31,883 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 35 [2025-03-08 00:37:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:31,884 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2025-03-08 00:37:31,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2025-03-08 00:37:31,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:37:31,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:31,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:31,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:32,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:32,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:32,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1775812970, now seen corresponding path program 2 times [2025-03-08 00:37:32,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:32,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855620889] [2025-03-08 00:37:32,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:32,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-08 00:37:32,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:37:32,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:32,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:37:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:32,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855620889] [2025-03-08 00:37:32,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855620889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277696751] [2025-03-08 00:37:32,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:32,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:32,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:32,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:32,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:37:32,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-08 00:37:32,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:37:32,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:32,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:32,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:37:32,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:37:32,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:37:32,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277696751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:32,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:32,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-08 00:37:32,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830912713] [2025-03-08 00:37:32,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:32,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:37:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:32,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:37:32,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:37:32,313 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:32,424 INFO L93 Difference]: Finished difference Result 131 states and 175 transitions. [2025-03-08 00:37:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:37:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-03-08 00:37:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:32,426 INFO L225 Difference]: With dead ends: 131 [2025-03-08 00:37:32,426 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 00:37:32,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:37:32,427 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:32,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 00:37:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2025-03-08 00:37:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3125) internal successors, (105), 82 states have internal predecessors, (105), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:37:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2025-03-08 00:37:32,451 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 35 [2025-03-08 00:37:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:32,452 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2025-03-08 00:37:32,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2025-03-08 00:37:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:37:32,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:32,455 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:32,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 00:37:32,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:32,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:32,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2125800999, now seen corresponding path program 3 times [2025-03-08 00:37:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208254869] [2025-03-08 00:37:32,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:32,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 5 equivalence classes. [2025-03-08 00:37:32,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 36 of 37 statements. [2025-03-08 00:37:32,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:37:32,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:37:32,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:32,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208254869] [2025-03-08 00:37:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208254869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:32,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530060026] [2025-03-08 00:37:32,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:32,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:32,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:32,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:32,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:37:32,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 5 equivalence classes. [2025-03-08 00:37:32,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 36 of 37 statements. [2025-03-08 00:37:32,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:37:32,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:32,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:37:32,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:37:32,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:37:32,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530060026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:32,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:32,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 00:37:32,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820111603] [2025-03-08 00:37:32,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:32,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:37:32,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:32,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:37:32,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:37:32,842 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:37:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:32,912 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2025-03-08 00:37:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:37:32,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-03-08 00:37:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:32,913 INFO L225 Difference]: With dead ends: 142 [2025-03-08 00:37:32,913 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 00:37:32,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:37:32,914 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:32,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:37:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 00:37:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-03-08 00:37:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 00:37:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2025-03-08 00:37:32,926 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 37 [2025-03-08 00:37:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:32,926 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2025-03-08 00:37:32,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:37:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2025-03-08 00:37:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:37:32,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:32,927 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:32,932 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-08 00:37:33,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:33,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:33,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:33,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1688624308, now seen corresponding path program 3 times [2025-03-08 00:37:33,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:33,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852750520] [2025-03-08 00:37:33,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:33,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 7 equivalence classes. [2025-03-08 00:37:33,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 39 statements. [2025-03-08 00:37:33,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:37:33,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:37:33,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852750520] [2025-03-08 00:37:33,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852750520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133885040] [2025-03-08 00:37:33,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:33,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:33,267 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:33,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:37:33,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 7 equivalence classes. [2025-03-08 00:37:33,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 39 statements. [2025-03-08 00:37:33,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:37:33,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:33,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:37:33,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:37:33,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:37:33,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133885040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:33,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:33,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 24 [2025-03-08 00:37:33,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250536908] [2025-03-08 00:37:33,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:33,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:37:33,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:33,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:37:33,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:37:33,615 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 18 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:37:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:33,898 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2025-03-08 00:37:33,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:37:33,902 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 18 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2025-03-08 00:37:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:33,902 INFO L225 Difference]: With dead ends: 104 [2025-03-08 00:37:33,902 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 00:37:33,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:37:33,903 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 87 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:33,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 150 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:37:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 00:37:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-03-08 00:37:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 72 states have internal predecessors, (85), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:37:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2025-03-08 00:37:33,910 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 39 [2025-03-08 00:37:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:33,910 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2025-03-08 00:37:33,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 18 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:37:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2025-03-08 00:37:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:37:33,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:33,911 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:33,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 00:37:34,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:37:34,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:34,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1885137813, now seen corresponding path program 4 times [2025-03-08 00:37:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095708850] [2025-03-08 00:37:34,115 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:37:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:34,122 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:37:34,127 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 39 statements. [2025-03-08 00:37:34,127 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:37:34,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 00:37:34,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:34,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095708850] [2025-03-08 00:37:34,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095708850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:34,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501329205] [2025-03-08 00:37:34,180 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:37:34,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:34,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:34,182 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:34,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:37:34,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:37:34,227 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 39 statements. [2025-03-08 00:37:34,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:37:34,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:34,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:37:34,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:37:34,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 00:37:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501329205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:34,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:34,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:37:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404307977] [2025-03-08 00:37:34,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:34,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:37:34,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:34,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:37:34,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:37:34,321 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:34,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:34,413 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2025-03-08 00:37:34,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:37:34,413 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2025-03-08 00:37:34,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:34,414 INFO L225 Difference]: With dead ends: 95 [2025-03-08 00:37:34,414 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 00:37:34,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:37:34,415 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:34,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 119 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 00:37:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2025-03-08 00:37:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 60 states have internal predecessors, (70), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 00:37:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2025-03-08 00:37:34,420 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 39 [2025-03-08 00:37:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:34,421 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2025-03-08 00:37:34,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2025-03-08 00:37:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:37:34,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:34,421 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:34,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:37:34,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:34,624 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:34,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:34,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1235397788, now seen corresponding path program 4 times [2025-03-08 00:37:34,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:34,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433762154] [2025-03-08 00:37:34,625 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:37:34,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:34,633 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-08 00:37:34,646 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:37:34,647 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:37:34,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:37:34,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1460303842] [2025-03-08 00:37:34,648 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:37:34,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:34,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:34,650 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:34,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:37:34,684 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-08 00:37:34,838 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:37:34,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:37:34,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:34,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-08 00:37:34,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:34,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:37:34,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:37:35,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:35,033 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-08 00:37:35,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:35,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 00:37:35,381 INFO L349 Elim1Store]: treesize reduction 104, result has 37.0 percent of original size [2025-03-08 00:37:35,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 73 [2025-03-08 00:37:36,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:36,126 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 124 treesize of output 56 [2025-03-08 00:37:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:37:36,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:43,072 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int) (v_ArrVal_170 Int)) (or (< (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) v_ArrVal_170) (< (let ((.cse1 (* c_~ARR_SIZE~0 4))) (let ((.cse0 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~index1~0#1| .cse1) |c_ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4)) v_ArrVal_170))) (+ (select .cse0 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~sum~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse1 4)) 1 (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4))))) (* c_~ARR_SIZE~0 2)))) is different from false [2025-03-08 00:37:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433762154] [2025-03-08 00:37:43,109 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:37:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460303842] [2025-03-08 00:37:43,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460303842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:43,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:37:43,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2025-03-08 00:37:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511652971] [2025-03-08 00:37:43,110 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:43,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:37:43,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:43,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:37:43,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1089, Unknown=1, NotChecked=68, Total=1332 [2025-03-08 00:37:43,111 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:37:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:43,568 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2025-03-08 00:37:43,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 00:37:43,569 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-03-08 00:37:43,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:43,569 INFO L225 Difference]: With dead ends: 124 [2025-03-08 00:37:43,569 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 00:37:43,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=222, Invalid=1587, Unknown=1, NotChecked=82, Total=1892 [2025-03-08 00:37:43,570 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 59 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:43,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 202 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:37:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 00:37:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2025-03-08 00:37:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 83 states have internal predecessors, (100), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:37:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2025-03-08 00:37:43,586 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 44 [2025-03-08 00:37:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:43,586 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2025-03-08 00:37:43,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:37:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2025-03-08 00:37:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:37:43,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:43,586 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:43,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:43,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:37:43,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:43,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1552017699, now seen corresponding path program 5 times [2025-03-08 00:37:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:43,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102333986] [2025-03-08 00:37:43,788 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:37:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:43,793 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 7 equivalence classes. [2025-03-08 00:37:43,819 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:37:43,820 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-08 00:37:43,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:37:43,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [391928254] [2025-03-08 00:37:43,821 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:37:43,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:43,823 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:43,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:37:43,859 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 7 equivalence classes. [2025-03-08 00:37:44,032 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:37:44,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-08 00:37:44,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:44,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-08 00:37:44,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:44,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:37:44,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:37:44,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:44,150 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-08 00:37:44,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:44,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 00:37:44,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:44,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:44,658 INFO L349 Elim1Store]: treesize reduction 200, result has 12.7 percent of original size [2025-03-08 00:37:44,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 84 treesize of output 94 [2025-03-08 00:37:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:37:44,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:45,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102333986] [2025-03-08 00:37:45,477 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:37:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391928254] [2025-03-08 00:37:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391928254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:45,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:37:45,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2025-03-08 00:37:45,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253767158] [2025-03-08 00:37:45,477 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:45,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:37:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:45,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:37:45,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1257, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 00:37:45,479 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 22 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:45,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:45,873 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2025-03-08 00:37:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 00:37:45,874 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 22 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2025-03-08 00:37:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:45,874 INFO L225 Difference]: With dead ends: 152 [2025-03-08 00:37:45,875 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 00:37:45,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=1390, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 00:37:45,875 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 25 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:45,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 361 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:37:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 00:37:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2025-03-08 00:37:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 96 states have internal predecessors, (115), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:37:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2025-03-08 00:37:45,886 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 44 [2025-03-08 00:37:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:45,887 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2025-03-08 00:37:45,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 22 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2025-03-08 00:37:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:37:45,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:45,887 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:45,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:37:46,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:37:46,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:46,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash -356418966, now seen corresponding path program 5 times [2025-03-08 00:37:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361088907] [2025-03-08 00:37:46,089 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:37:46,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:46,097 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 7 equivalence classes. [2025-03-08 00:37:46,103 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 23 of 45 statements. [2025-03-08 00:37:46,103 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:37:46,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:37:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361088907] [2025-03-08 00:37:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361088907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:46,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295379350] [2025-03-08 00:37:46,176 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:37:46,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:46,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:46,178 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:46,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:37:46,215 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 7 equivalence classes. [2025-03-08 00:37:46,230 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 23 of 45 statements. [2025-03-08 00:37:46,230 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:37:46,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:46,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:37:46,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:37:46,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:37:46,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295379350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:46,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:46,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-08 00:37:46,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125504600] [2025-03-08 00:37:46,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:46,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:37:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:46,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:37:46,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:37:46,328 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:46,419 INFO L93 Difference]: Finished difference Result 214 states and 263 transitions. [2025-03-08 00:37:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:37:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2025-03-08 00:37:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:46,420 INFO L225 Difference]: With dead ends: 214 [2025-03-08 00:37:46,421 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 00:37:46,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:37:46,422 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:46,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 96 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 00:37:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2025-03-08 00:37:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.2053571428571428) internal successors, (135), 112 states have internal predecessors, (135), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 00:37:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2025-03-08 00:37:46,436 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 45 [2025-03-08 00:37:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:46,437 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2025-03-08 00:37:46,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2025-03-08 00:37:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:37:46,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:46,438 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:46,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 00:37:46,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:37:46,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:46,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1533177658, now seen corresponding path program 6 times [2025-03-08 00:37:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:46,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3915380] [2025-03-08 00:37:46,639 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:37:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:46,648 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 7 equivalence classes. [2025-03-08 00:37:46,658 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:37:46,658 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:37:46,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:37:46,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:46,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3915380] [2025-03-08 00:37:46,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3915380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:46,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805213264] [2025-03-08 00:37:46,721 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:37:46,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:46,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:46,723 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:46,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:37:46,761 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 7 equivalence classes. [2025-03-08 00:37:46,947 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:37:46,948 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:37:46,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:46,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:37:46,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:37:47,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:37:47,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805213264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:47,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:47,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-08 00:37:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64905397] [2025-03-08 00:37:47,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:47,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:37:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:47,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:37:47,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:37:47,066 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:47,267 INFO L93 Difference]: Finished difference Result 177 states and 212 transitions. [2025-03-08 00:37:47,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:37:47,267 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2025-03-08 00:37:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:47,269 INFO L225 Difference]: With dead ends: 177 [2025-03-08 00:37:47,269 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 00:37:47,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:37:47,269 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:47,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 213 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 00:37:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2025-03-08 00:37:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.216) internal successors, (152), 125 states have internal predecessors, (152), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 00:37:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2025-03-08 00:37:47,285 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 45 [2025-03-08 00:37:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:47,285 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2025-03-08 00:37:47,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2025-03-08 00:37:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:37:47,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:47,286 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:47,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 00:37:47,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:37:47,487 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:47,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:47,487 INFO L85 PathProgramCache]: Analyzing trace with hash 194295962, now seen corresponding path program 1 times [2025-03-08 00:37:47,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281603050] [2025-03-08 00:37:47,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:47,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:37:47,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:37:47,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:47,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:37:47,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [908212762] [2025-03-08 00:37:47,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:47,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:47,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:47,499 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:47,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:37:47,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:37:47,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:37:47,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:47,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:47,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 00:37:47,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:47,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:37:47,708 INFO L349 Elim1Store]: treesize reduction 28, result has 50.0 percent of original size [2025-03-08 00:37:47,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 46 [2025-03-08 00:37:47,899 INFO L349 Elim1Store]: treesize reduction 90, result has 19.6 percent of original size [2025-03-08 00:37:47,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 44 [2025-03-08 00:37:47,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:47,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2025-03-08 00:37:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:37:47,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:52,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281603050] [2025-03-08 00:37:52,177 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:37:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908212762] [2025-03-08 00:37:52,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908212762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:52,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:37:52,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2025-03-08 00:37:52,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906234911] [2025-03-08 00:37:52,177 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:52,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:37:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:52,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:37:52,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=439, Unknown=1, NotChecked=0, Total=552 [2025-03-08 00:37:52,177 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:37:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:52,447 INFO L93 Difference]: Finished difference Result 214 states and 258 transitions. [2025-03-08 00:37:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:37:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2025-03-08 00:37:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:52,448 INFO L225 Difference]: With dead ends: 214 [2025-03-08 00:37:52,448 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 00:37:52,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=187, Invalid=804, Unknown=1, NotChecked=0, Total=992 [2025-03-08 00:37:52,449 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 53 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:52,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 121 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 00:37:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 118. [2025-03-08 00:37:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.25) internal successors, (125), 100 states have internal predecessors, (125), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:37:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2025-03-08 00:37:52,464 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 49 [2025-03-08 00:37:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:52,464 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2025-03-08 00:37:52,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:37:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2025-03-08 00:37:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:37:52,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:52,465 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:52,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:52,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:52,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:52,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash -824983938, now seen corresponding path program 7 times [2025-03-08 00:37:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:52,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649438680] [2025-03-08 00:37:52,666 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:37:52,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:52,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:37:52,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:37:52,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:52,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:37:52,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:52,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649438680] [2025-03-08 00:37:52,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649438680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:52,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972131234] [2025-03-08 00:37:52,761 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:37:52,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:52,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:52,763 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:52,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 00:37:52,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:37:52,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:37:52,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:52,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:52,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:37:52,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:37:52,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:37:53,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972131234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:53,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:53,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-08 00:37:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331989553] [2025-03-08 00:37:53,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:53,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:37:53,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:53,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:37:53,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:37:53,011 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:53,146 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2025-03-08 00:37:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:37:53,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2025-03-08 00:37:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:53,147 INFO L225 Difference]: With dead ends: 142 [2025-03-08 00:37:53,147 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 00:37:53,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:37:53,148 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:53,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 94 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 00:37:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2025-03-08 00:37:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 92 states have internal predecessors, (111), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:37:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2025-03-08 00:37:53,161 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 48 [2025-03-08 00:37:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:53,162 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2025-03-08 00:37:53,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2025-03-08 00:37:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 00:37:53,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:53,162 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:53,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:53,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 00:37:53,363 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash 951714882, now seen corresponding path program 8 times [2025-03-08 00:37:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:53,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729601047] [2025-03-08 00:37:53,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:53,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-08 00:37:53,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:37:53,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:53,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 00:37:53,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:53,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729601047] [2025-03-08 00:37:53,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729601047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:53,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971289999] [2025-03-08 00:37:53,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:53,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:53,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:53,470 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:53,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:37:53,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-08 00:37:53,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:37:53,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:53,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:53,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:37:53,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 00:37:53,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 00:37:53,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971289999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:53,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:53,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 00:37:53,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224221766] [2025-03-08 00:37:53,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:53,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:37:53,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:53,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:37:53,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:37:53,655 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:53,780 INFO L93 Difference]: Finished difference Result 164 states and 201 transitions. [2025-03-08 00:37:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:37:53,781 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2025-03-08 00:37:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:53,781 INFO L225 Difference]: With dead ends: 164 [2025-03-08 00:37:53,781 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 00:37:53,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:37:53,782 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:53,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 124 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 00:37:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2025-03-08 00:37:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 97 states have internal predecessors, (117), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:37:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2025-03-08 00:37:53,797 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 50 [2025-03-08 00:37:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:53,797 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2025-03-08 00:37:53,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2025-03-08 00:37:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 00:37:53,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:53,797 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:53,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:53,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:37:53,998 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:53,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:53,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1852016834, now seen corresponding path program 9 times [2025-03-08 00:37:53,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:53,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582975659] [2025-03-08 00:37:53,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:54,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 11 equivalence classes. [2025-03-08 00:37:54,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 44 of 55 statements. [2025-03-08 00:37:54,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:37:54,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:37:54,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582975659] [2025-03-08 00:37:54,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582975659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210760876] [2025-03-08 00:37:54,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:54,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:54,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:54,071 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:54,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:37:54,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 11 equivalence classes. [2025-03-08 00:37:54,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 44 of 55 statements. [2025-03-08 00:37:54,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:37:54,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:54,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:37:54,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:37:54,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:37:54,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210760876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:54,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:54,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-08 00:37:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311802368] [2025-03-08 00:37:54,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:54,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:37:54,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:54,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:37:54,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:37:54,364 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:37:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:54,475 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2025-03-08 00:37:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:37:54,476 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-03-08 00:37:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:54,477 INFO L225 Difference]: With dead ends: 168 [2025-03-08 00:37:54,477 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 00:37:54,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:37:54,477 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:54,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 118 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 00:37:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-08 00:37:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 88 states have internal predecessors, (103), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:37:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2025-03-08 00:37:54,501 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 55 [2025-03-08 00:37:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:54,501 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2025-03-08 00:37:54,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:37:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2025-03-08 00:37:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 00:37:54,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:54,502 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:54,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:54,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:54,702 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:54,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash 713643054, now seen corresponding path program 1 times [2025-03-08 00:37:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944719620] [2025-03-08 00:37:54,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:54,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 00:37:54,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:37:54,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:54,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:37:54,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628975189] [2025-03-08 00:37:54,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:54,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:54,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:54,727 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:54,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:37:54,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 00:37:55,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:37:55,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:55,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:55,201 WARN L254 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-03-08 00:37:55,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:55,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:37:55,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:37:55,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:55,371 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-08 00:37:55,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:55,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 00:37:55,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:55,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:55,891 INFO L349 Elim1Store]: treesize reduction 120, result has 30.6 percent of original size [2025-03-08 00:37:55,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 32 case distinctions, treesize of input 74 treesize of output 118 [2025-03-08 00:37:56,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:56,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:57,141 INFO L349 Elim1Store]: treesize reduction 420, result has 28.3 percent of original size [2025-03-08 00:37:57,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 8 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 85 case distinctions, treesize of input 138 treesize of output 281 [2025-03-08 00:37:59,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:59,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 73 [2025-03-08 00:37:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:37:59,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944719620] [2025-03-08 00:38:00,821 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:38:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628975189] [2025-03-08 00:38:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628975189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:00,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:38:00,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2025-03-08 00:38:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628514894] [2025-03-08 00:38:00,821 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:00,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 00:38:00,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:00,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 00:38:00,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2740, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 00:38:00,823 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 39 states, 37 states have (on average 1.162162162162162) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:38:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:01,650 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2025-03-08 00:38:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-08 00:38:01,651 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.162162162162162) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 59 [2025-03-08 00:38:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:01,651 INFO L225 Difference]: With dead ends: 135 [2025-03-08 00:38:01,652 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 00:38:01,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=394, Invalid=3266, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 00:38:01,653 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:01,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 280 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:38:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 00:38:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2025-03-08 00:38:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 96 states have internal predecessors, (112), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:38:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2025-03-08 00:38:01,666 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 59 [2025-03-08 00:38:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:01,666 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2025-03-08 00:38:01,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.162162162162162) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:38:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2025-03-08 00:38:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 00:38:01,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:01,667 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:01,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 00:38:01,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:01,867 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:01,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:01,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2073772433, now seen corresponding path program 1 times [2025-03-08 00:38:01,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:01,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332200271] [2025-03-08 00:38:01,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:01,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:01,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 00:38:01,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:38:01,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:01,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:38:01,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011556709] [2025-03-08 00:38:01,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:01,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:01,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:01,886 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:01,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:38:01,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 00:38:02,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:38:02,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:02,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-08 00:38:02,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:02,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:38:02,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:38:02,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:02,180 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 28 treesize of output 30 [2025-03-08 00:38:02,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:02,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-08 00:38:02,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,469 INFO L349 Elim1Store]: treesize reduction 72, result has 48.9 percent of original size [2025-03-08 00:38:02,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 96 [2025-03-08 00:38:05,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:05,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:05,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:05,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:06,093 INFO L349 Elim1Store]: treesize reduction 696, result has 8.2 percent of original size [2025-03-08 00:38:06,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 6 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 54 case distinctions, treesize of input 228 treesize of output 133 [2025-03-08 00:38:08,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:08,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:08,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:08,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:08,270 INFO L349 Elim1Store]: treesize reduction 152, result has 29.3 percent of original size [2025-03-08 00:38:08,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 226 treesize of output 126 [2025-03-08 00:38:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:38:08,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:15,348 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (< (let ((.cse1 (* c_~ARR_SIZE~0 4))) (let ((.cse0 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~index1~0#1| .cse1) |c_ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse1 4)) |c_ULTIMATE.start_main_~sum~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse1)) (select .cse0 |c_ULTIMATE.start_main_~#array~0#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 1))) (* c_~ARR_SIZE~0 2))) is different from false [2025-03-08 00:38:15,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332200271] [2025-03-08 00:38:15,364 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:38:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011556709] [2025-03-08 00:38:15,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011556709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:15,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:38:15,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2025-03-08 00:38:15,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72412557] [2025-03-08 00:38:15,364 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:15,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:38:15,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:15,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:38:15,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1287, Unknown=2, NotChecked=74, Total=1560 [2025-03-08 00:38:15,365 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 26 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:38:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:22,828 INFO L93 Difference]: Finished difference Result 183 states and 213 transitions. [2025-03-08 00:38:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 00:38:22,828 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 26 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2025-03-08 00:38:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:22,829 INFO L225 Difference]: With dead ends: 183 [2025-03-08 00:38:22,829 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 00:38:22,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=270, Invalid=2083, Unknown=3, NotChecked=94, Total=2450 [2025-03-08 00:38:22,830 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:22,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 219 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:38:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 00:38:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 114. [2025-03-08 00:38:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 96 states have internal predecessors, (112), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:38:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2025-03-08 00:38:22,853 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 59 [2025-03-08 00:38:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:22,853 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2025-03-08 00:38:22,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 26 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:38:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2025-03-08 00:38:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 00:38:22,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:22,854 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:22,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-08 00:38:23,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:23,054 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:23,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash 724959181, now seen corresponding path program 2 times [2025-03-08 00:38:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:23,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-03-08 00:38:23,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:38:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:23,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-08 00:38:23,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:38:23,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:38:23,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:38:23,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866025533] [2025-03-08 00:38:23,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:38:23,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:23,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:23,069 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:23,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 00:38:23,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-08 00:38:23,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:38:23,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:38:23,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:23,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-08 00:38:23,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:23,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:38:23,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:38:23,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:23,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:23,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:23,691 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 28 treesize of output 30 [2025-03-08 00:38:23,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:23,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:23,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:23,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:23,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:23,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-08 00:38:24,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:24,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:24,268 INFO L349 Elim1Store]: treesize reduction 200, result has 12.7 percent of original size [2025-03-08 00:38:24,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 84 treesize of output 94 [2025-03-08 00:38:24,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:24,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:24,619 INFO L349 Elim1Store]: treesize reduction 120, result has 30.6 percent of original size [2025-03-08 00:38:24,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 32 case distinctions, treesize of input 74 treesize of output 118 [2025-03-08 00:38:25,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:25,012 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 59 treesize of output 27 [2025-03-08 00:38:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 00:38:25,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:26,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:26,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-03-08 00:38:26,004 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:38:26,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866025533] [2025-03-08 00:38:26,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866025533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:26,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:38:26,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2025-03-08 00:38:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87861491] [2025-03-08 00:38:26,005 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:26,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:38:26,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:26,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:38:26,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1997, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 00:38:26,006 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:38:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:26,526 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2025-03-08 00:38:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 00:38:26,527 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2025-03-08 00:38:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:26,528 INFO L225 Difference]: With dead ends: 151 [2025-03-08 00:38:26,528 INFO L226 Difference]: Without dead ends: 138 [2025-03-08 00:38:26,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=274, Invalid=2078, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:38:26,529 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:26,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 284 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:38:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-08 00:38:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2025-03-08 00:38:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 104 states have internal predecessors, (121), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 00:38:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2025-03-08 00:38:26,559 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 59 [2025-03-08 00:38:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:26,559 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2025-03-08 00:38:26,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:38:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2025-03-08 00:38:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 00:38:26,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:26,560 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:26,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 00:38:26,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 00:38:26,760 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:26,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash 545091532, now seen corresponding path program 10 times [2025-03-08 00:38:26,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:26,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438898715] [2025-03-08 00:38:26,761 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:38:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:26,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-08 00:38:26,777 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 00:38:26,777 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:38:26,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:38:26,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1104022793] [2025-03-08 00:38:26,778 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:38:26,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:26,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:26,780 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:26,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:38:26,833 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-08 00:38:27,706 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 00:38:27,706 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:38:27,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:27,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-08 00:38:27,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:27,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:38:27,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:38:27,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:27,849 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-08 00:38:27,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:27,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:27,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:27,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:27,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 00:38:27,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:27,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:27,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:27,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:28,002 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 6 case distinctions, treesize of input 46 treesize of output 54 [2025-03-08 00:38:28,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:28,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-08 00:38:28,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:28,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-08 00:38:28,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:28,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 77 treesize of output 94 [2025-03-08 00:38:28,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:28,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:28,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 88 treesize of output 108 [2025-03-08 00:38:29,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:29,742 INFO L349 Elim1Store]: treesize reduction 506, result has 34.2 percent of original size [2025-03-08 00:38:29,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 37 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 169 case distinctions, treesize of input 186 treesize of output 346 [2025-03-08 00:38:42,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:42,175 INFO L190 IndexEqualityManager]: detected not equals via solver