./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i -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 a84128d9dc2647965d087aabf3251d6852e74faf39ebdf7a8caa157044f8c0e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:28:47,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:28:47,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:28:47,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:28:47,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:28:47,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:28:47,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:28:47,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:28:47,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:28:47,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:28:47,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:28:47,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:28:47,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:28:47,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:28:47,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:28:47,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:28:47,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:28:47,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:28:47,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:28:47,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:28:47,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:28:47,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:28:47,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:28:47,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:28:47,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:28:47,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:28:47,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:28:47,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:28:47,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:28:47,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:28:47,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:28:47,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:28:47,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:28:47,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:28:47,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:28:47,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:28:47,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:28:47,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:28:47,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:28:47,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:28:47,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:28:47,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:28:47,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:28:47,872 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 -> a84128d9dc2647965d087aabf3251d6852e74faf39ebdf7a8caa157044f8c0e2 [2025-03-17 01:28:48,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:28:48,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:28:48,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:28:48,105 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:28:48,106 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:28:48,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-03-17 01:28:49,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d7c6102/e925d57e6f3d465db409e127b8c3e2b2/FLAG05d1cf2e1 [2025-03-17 01:28:49,511 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:28:49,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-03-17 01:28:49,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d7c6102/e925d57e6f3d465db409e127b8c3e2b2/FLAG05d1cf2e1 [2025-03-17 01:28:49,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d7c6102/e925d57e6f3d465db409e127b8c3e2b2 [2025-03-17 01:28:49,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:28:49,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:28:49,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:28:49,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:28:49,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:28:49,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:28:49" (1/1) ... [2025-03-17 01:28:49,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b90c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:49, skipping insertion in model container [2025-03-17 01:28:49,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:28:49" (1/1) ... [2025-03-17 01:28:49,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:28:49,963 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i[918,931] [2025-03-17 01:28:50,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:28:50,014 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:28:50,023 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i[918,931] [2025-03-17 01:28:50,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:28:50,055 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:28:50,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50 WrapperNode [2025-03-17 01:28:50,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:28:50,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:28:50,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:28:50,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:28:50,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,097 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-03-17 01:28:50,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:28:50,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:28:50,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:28:50,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:28:50,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,119 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:28:50,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:28:50,139 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:28:50,139 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:28:50,139 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:28:50,140 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (1/1) ... [2025-03-17 01:28:50,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:28:50,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:28:50,171 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-17 01:28:50,174 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-17 01:28:50,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:28:50,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:28:50,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:28:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:28:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:28:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:28:50,247 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:28:50,248 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:28:50,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-03-17 01:28:50,658 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 01:28:50,658 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:28:50,677 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:28:50,677 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:28:50,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:28:50 BoogieIcfgContainer [2025-03-17 01:28:50,678 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:28:50,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:28:50,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:28:50,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:28:50,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:28:49" (1/3) ... [2025-03-17 01:28:50,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ed4483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:28:50, skipping insertion in model container [2025-03-17 01:28:50,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:50" (2/3) ... [2025-03-17 01:28:50,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ed4483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:28:50, skipping insertion in model container [2025-03-17 01:28:50,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:28:50" (3/3) ... [2025-03-17 01:28:50,686 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-03-17 01:28:50,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:28:50,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:28:50,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:28:50,754 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;@6e3902e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:28:50,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:28:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 71 states have internal predecessors, (107), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:28:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 01:28:50,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:28:50,765 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1] [2025-03-17 01:28:50,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:28:50,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:28:50,769 INFO L85 PathProgramCache]: Analyzing trace with hash 755457646, now seen corresponding path program 1 times [2025-03-17 01:28:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:28:50,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038005956] [2025-03-17 01:28:50,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:28:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:28:50,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 01:28:50,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 01:28:50,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:28:50,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:28:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 01:28:51,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:28:51,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038005956] [2025-03-17 01:28:51,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038005956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:28:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570482448] [2025-03-17 01:28:51,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:28:51,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:28:51,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:28:51,035 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-17 01:28:51,051 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-17 01:28:51,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 01:28:51,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 01:28:51,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:28:51,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:28:51,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:28:51,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:28:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 01:28:51,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:28:51,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570482448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:28:51,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:28:51,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:28:51,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598890825] [2025-03-17 01:28:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:28:51,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:28:51,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:28:51,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:28:51,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:28:51,231 INFO L87 Difference]: Start difference. First operand has 92 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 71 states have internal predecessors, (107), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:28:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:28:51,271 INFO L93 Difference]: Finished difference Result 181 states and 307 transitions. [2025-03-17 01:28:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:28:51,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2025-03-17 01:28:51,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:28:51,280 INFO L225 Difference]: With dead ends: 181 [2025-03-17 01:28:51,280 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 01:28:51,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-17 01:28:51,286 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:28:51,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:28:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 01:28:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 01:28:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:28:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2025-03-17 01:28:51,321 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 134 [2025-03-17 01:28:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:28:51,322 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2025-03-17 01:28:51,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:28:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2025-03-17 01:28:51,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 01:28:51,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:28:51,326 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1] [2025-03-17 01:28:51,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:28:51,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:28:51,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:28:51,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:28:51,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1092398671, now seen corresponding path program 1 times [2025-03-17 01:28:51,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:28:51,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227292586] [2025-03-17 01:28:51,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:28:51,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:28:51,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 01:28:51,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 01:28:51,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:28:51,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:28:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:28:51,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:28:51,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227292586] [2025-03-17 01:28:51,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227292586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:28:51,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:28:51,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:28:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34424143] [2025-03-17 01:28:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:28:51,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:28:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:28:51,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:28:51,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:28:51,772 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:28:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:28:51,801 INFO L93 Difference]: Finished difference Result 180 states and 281 transitions. [2025-03-17 01:28:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:28:51,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 134 [2025-03-17 01:28:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:28:51,805 INFO L225 Difference]: With dead ends: 180 [2025-03-17 01:28:51,805 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 01:28:51,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:28:51,806 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:28:51,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:28:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 01:28:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 01:28:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 70 states have internal predecessors, (103), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:28:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2025-03-17 01:28:51,819 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 141 transitions. Word has length 134 [2025-03-17 01:28:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:28:51,820 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 141 transitions. [2025-03-17 01:28:51,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:28:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 141 transitions. [2025-03-17 01:28:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 01:28:51,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:28:51,822 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1] [2025-03-17 01:28:51,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:28:51,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:28:51,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:28:51,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1537103784, now seen corresponding path program 1 times [2025-03-17 01:28:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:28:51,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307908950] [2025-03-17 01:28:51,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:28:51,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:28:51,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:28:51,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:28:51,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:28:51,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:28:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:28:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:28:51,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307908950] [2025-03-17 01:28:51,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307908950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:28:51,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:28:51,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:28:51,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61003193] [2025-03-17 01:28:51,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:28:51,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:28:51,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:28:51,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:28:51,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:28:51,940 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:28:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:28:52,017 INFO L93 Difference]: Finished difference Result 256 states and 394 transitions. [2025-03-17 01:28:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:28:52,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2025-03-17 01:28:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:28:52,019 INFO L225 Difference]: With dead ends: 256 [2025-03-17 01:28:52,019 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 01:28:52,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:28:52,020 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 111 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:28:52,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 301 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:28:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 01:28:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2025-03-17 01:28:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 128 states have (on average 1.4375) internal successors, (184), 129 states have internal predecessors, (184), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:28:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2025-03-17 01:28:52,047 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 135 [2025-03-17 01:28:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:28:52,048 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2025-03-17 01:28:52,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:28:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2025-03-17 01:28:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 01:28:52,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:28:52,052 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1] [2025-03-17 01:28:52,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:28:52,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:28:52,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:28:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash -259847575, now seen corresponding path program 1 times [2025-03-17 01:28:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:28:52,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801761658] [2025-03-17 01:28:52,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:28:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:28:52,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:28:52,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:28:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:28:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:28:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:28:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:28:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801761658] [2025-03-17 01:28:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801761658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:28:54,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621309226] [2025-03-17 01:28:54,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:28:54,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:28:54,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:28:54,834 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-17 01:28:54,836 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-17 01:28:54,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:28:54,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:28:54,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:28:54,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:28:54,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:28:54,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:28:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 242 proven. 54 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-17 01:28:55,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:28:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:28:55,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621309226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:28:55,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:28:55,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 20 [2025-03-17 01:28:55,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352016668] [2025-03-17 01:28:55,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:28:55,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 01:28:55,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:28:55,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 01:28:55,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-17 01:28:55,553 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 20 states, 20 states have (on average 5.45) internal successors, (109), 20 states have internal predecessors, (109), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) [2025-03-17 01:28:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:28:58,175 INFO L93 Difference]: Finished difference Result 590 states and 885 transitions. [2025-03-17 01:28:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 01:28:58,176 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.45) internal successors, (109), 20 states have internal predecessors, (109), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) Word has length 135 [2025-03-17 01:28:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:28:58,183 INFO L225 Difference]: With dead ends: 590 [2025-03-17 01:28:58,183 INFO L226 Difference]: Without dead ends: 428 [2025-03-17 01:28:58,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2025-03-17 01:28:58,184 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 664 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:28:58,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 546 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 01:28:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-17 01:28:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 179. [2025-03-17 01:28:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 141 states have internal predecessors, (194), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:28:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 258 transitions. [2025-03-17 01:28:58,208 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 258 transitions. Word has length 135 [2025-03-17 01:28:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:28:58,208 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 258 transitions. [2025-03-17 01:28:58,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.45) internal successors, (109), 20 states have internal predecessors, (109), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) [2025-03-17 01:28:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 258 transitions. [2025-03-17 01:28:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 01:28:58,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:28:58,210 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1] [2025-03-17 01:28:58,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:28:58,410 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-17 01:28:58,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:28:58,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:28:58,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1997063432, now seen corresponding path program 1 times [2025-03-17 01:28:58,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:28:58,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889013451] [2025-03-17 01:28:58,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:28:58,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:28:58,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:28:58,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:28:58,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:28:58,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:00,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:00,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889013451] [2025-03-17 01:29:00,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889013451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:00,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505176494] [2025-03-17 01:29:00,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:00,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:00,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:00,601 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-17 01:29:00,603 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-17 01:29:00,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:00,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:00,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:00,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:00,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 01:29:00,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 01:29:01,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:29:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:02,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505176494] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:02,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:29:02,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 11] total 23 [2025-03-17 01:29:02,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851817166] [2025-03-17 01:29:02,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:02,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:29:02,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:02,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:29:02,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-03-17 01:29:02,200 INFO L87 Difference]: Start difference. First operand 179 states and 258 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:04,582 INFO L93 Difference]: Finished difference Result 831 states and 1218 transitions. [2025-03-17 01:29:04,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:29:04,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2025-03-17 01:29:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:04,586 INFO L225 Difference]: With dead ends: 831 [2025-03-17 01:29:04,586 INFO L226 Difference]: Without dead ends: 653 [2025-03-17 01:29:04,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2025-03-17 01:29:04,588 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 474 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:04,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 548 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 01:29:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-17 01:29:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 266. [2025-03-17 01:29:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 227 states have (on average 1.4449339207048457) internal successors, (328), 228 states have internal predecessors, (328), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:29:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 392 transitions. [2025-03-17 01:29:04,614 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 392 transitions. Word has length 135 [2025-03-17 01:29:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:04,614 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 392 transitions. [2025-03-17 01:29:04,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions. [2025-03-17 01:29:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 01:29:04,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:04,615 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1] [2025-03-17 01:29:04,622 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-17 01:29:04,816 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-17 01:29:04,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:04,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1236325183, now seen corresponding path program 1 times [2025-03-17 01:29:04,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:04,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010049817] [2025-03-17 01:29:04,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:04,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:04,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:04,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:04,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010049817] [2025-03-17 01:29:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010049817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068507119] [2025-03-17 01:29:08,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:08,480 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-17 01:29:08,481 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-17 01:29:08,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:08,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:08,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:08,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:08,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 01:29:08,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 462 proven. 51 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-17 01:29:09,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:29:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:10,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068507119] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:10,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:29:10,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 17] total 35 [2025-03-17 01:29:10,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145061012] [2025-03-17 01:29:10,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:10,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:29:10,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:10,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:29:10,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=984, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 01:29:10,603 INFO L87 Difference]: Start difference. First operand 266 states and 392 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:13,137 INFO L93 Difference]: Finished difference Result 1158 states and 1697 transitions. [2025-03-17 01:29:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:29:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2025-03-17 01:29:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:13,142 INFO L225 Difference]: With dead ends: 1158 [2025-03-17 01:29:13,143 INFO L226 Difference]: Without dead ends: 893 [2025-03-17 01:29:13,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 01:29:13,145 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 728 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:13,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 668 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 01:29:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-17 01:29:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 311. [2025-03-17 01:29:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 272 states have (on average 1.463235294117647) internal successors, (398), 273 states have internal predecessors, (398), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:29:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 462 transitions. [2025-03-17 01:29:13,173 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 462 transitions. Word has length 135 [2025-03-17 01:29:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:13,173 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 462 transitions. [2025-03-17 01:29:13,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 462 transitions. [2025-03-17 01:29:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 01:29:13,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:13,177 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1] [2025-03-17 01:29:13,183 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-17 01:29:13,377 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-17 01:29:13,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:13,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash -80145911, now seen corresponding path program 1 times [2025-03-17 01:29:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:13,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045269538] [2025-03-17 01:29:13,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:13,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:13,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:13,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:13,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:13,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:15,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:15,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045269538] [2025-03-17 01:29:15,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045269538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:15,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327650385] [2025-03-17 01:29:15,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:15,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:15,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:15,896 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-17 01:29:15,906 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-17 01:29:15,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:16,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:16,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:16,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:16,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 01:29:16,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:16,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:29:16,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327650385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:16,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:29:16,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 22 [2025-03-17 01:29:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77307554] [2025-03-17 01:29:16,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:16,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:29:16,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:16,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:29:16,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-17 01:29:16,303 INFO L87 Difference]: Start difference. First operand 311 states and 462 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:16,686 INFO L93 Difference]: Finished difference Result 1104 states and 1648 transitions. [2025-03-17 01:29:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:29:16,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2025-03-17 01:29:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:16,690 INFO L225 Difference]: With dead ends: 1104 [2025-03-17 01:29:16,690 INFO L226 Difference]: Without dead ends: 794 [2025-03-17 01:29:16,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-03-17 01:29:16,693 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 234 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:16,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 570 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:29:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-03-17 01:29:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 408. [2025-03-17 01:29:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 369 states have (on average 1.4742547425474255) internal successors, (544), 370 states have internal predecessors, (544), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:29:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 608 transitions. [2025-03-17 01:29:16,712 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 608 transitions. Word has length 135 [2025-03-17 01:29:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:16,713 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 608 transitions. [2025-03-17 01:29:16,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 608 transitions. [2025-03-17 01:29:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 01:29:16,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:16,714 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1] [2025-03-17 01:29:16,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 01:29:16,914 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-17 01:29:16,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:16,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash 981432770, now seen corresponding path program 1 times [2025-03-17 01:29:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:16,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917565364] [2025-03-17 01:29:16,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:16,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:16,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:16,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:16,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:21,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917565364] [2025-03-17 01:29:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917565364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:21,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330886289] [2025-03-17 01:29:21,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:21,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:21,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:21,552 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-17 01:29:21,552 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-17 01:29:21,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:21,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:21,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:21,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:21,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 01:29:21,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:21,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:29:21,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330886289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:21,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:29:21,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [20] total 24 [2025-03-17 01:29:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719452476] [2025-03-17 01:29:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:21,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:29:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:21,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:29:21,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:29:21,907 INFO L87 Difference]: Start difference. First operand 408 states and 608 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:22,196 INFO L93 Difference]: Finished difference Result 1105 states and 1645 transitions. [2025-03-17 01:29:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 01:29:22,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2025-03-17 01:29:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:22,210 INFO L225 Difference]: With dead ends: 1105 [2025-03-17 01:29:22,210 INFO L226 Difference]: Without dead ends: 698 [2025-03-17 01:29:22,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2025-03-17 01:29:22,214 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 157 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:22,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 590 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:29:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-17 01:29:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 408. [2025-03-17 01:29:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 369 states have (on average 1.4742547425474255) internal successors, (544), 370 states have internal predecessors, (544), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:29:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 608 transitions. [2025-03-17 01:29:22,238 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 608 transitions. Word has length 135 [2025-03-17 01:29:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:22,238 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 608 transitions. [2025-03-17 01:29:22,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 608 transitions. [2025-03-17 01:29:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 01:29:22,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:22,240 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1] [2025-03-17 01:29:22,247 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-17 01:29:22,440 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-17 01:29:22,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:22,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1742326887, now seen corresponding path program 1 times [2025-03-17 01:29:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:22,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543849291] [2025-03-17 01:29:22,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:22,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:22,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:22,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:22,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:22,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:22,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:22,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543849291] [2025-03-17 01:29:22,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543849291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:22,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190746433] [2025-03-17 01:29:22,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:22,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:22,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:22,899 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-17 01:29:22,901 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-17 01:29:22,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:23,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:23,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:23,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:23,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 01:29:23,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 01:29:23,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:29:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:23,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190746433] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:23,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:29:23,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 11] total 22 [2025-03-17 01:29:23,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215079203] [2025-03-17 01:29:23,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:23,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:29:23,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:23,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:29:23,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2025-03-17 01:29:23,895 INFO L87 Difference]: Start difference. First operand 408 states and 608 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:25,227 INFO L93 Difference]: Finished difference Result 1453 states and 2185 transitions. [2025-03-17 01:29:25,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:29:25,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2025-03-17 01:29:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:25,232 INFO L225 Difference]: With dead ends: 1453 [2025-03-17 01:29:25,232 INFO L226 Difference]: Without dead ends: 1046 [2025-03-17 01:29:25,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:29:25,234 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 446 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:25,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 816 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 01:29:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-17 01:29:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 410. [2025-03-17 01:29:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 371 states have (on average 1.477088948787062) internal successors, (548), 372 states have internal predecessors, (548), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:29:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 612 transitions. [2025-03-17 01:29:25,252 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 612 transitions. Word has length 135 [2025-03-17 01:29:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:25,252 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 612 transitions. [2025-03-17 01:29:25,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 612 transitions. [2025-03-17 01:29:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 01:29:25,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:25,254 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1] [2025-03-17 01:29:25,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 01:29:25,458 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-17 01:29:25,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:25,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1491061728, now seen corresponding path program 1 times [2025-03-17 01:29:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953392799] [2025-03-17 01:29:25,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:25,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:25,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:25,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:25,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:26,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:26,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953392799] [2025-03-17 01:29:26,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953392799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:26,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122053567] [2025-03-17 01:29:26,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:26,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:26,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:26,011 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-17 01:29:26,013 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-17 01:29:26,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:26,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:26,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:26,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 01:29:26,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 01:29:26,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:29:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122053567] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:27,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:29:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 11] total 24 [2025-03-17 01:29:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433367185] [2025-03-17 01:29:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:27,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:29:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:27,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:29:27,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:29:27,120 INFO L87 Difference]: Start difference. First operand 410 states and 612 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:28,297 INFO L93 Difference]: Finished difference Result 1463 states and 2203 transitions. [2025-03-17 01:29:28,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:29:28,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2025-03-17 01:29:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:28,305 INFO L225 Difference]: With dead ends: 1463 [2025-03-17 01:29:28,305 INFO L226 Difference]: Without dead ends: 1054 [2025-03-17 01:29:28,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2025-03-17 01:29:28,306 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 413 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:28,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 658 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:29:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-03-17 01:29:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 414. [2025-03-17 01:29:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 375 states have (on average 1.4773333333333334) internal successors, (554), 376 states have internal predecessors, (554), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:29:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 618 transitions. [2025-03-17 01:29:28,332 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 618 transitions. Word has length 135 [2025-03-17 01:29:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:28,333 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 618 transitions. [2025-03-17 01:29:28,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 618 transitions. [2025-03-17 01:29:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 01:29:28,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:28,336 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1] [2025-03-17 01:29:28,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 01:29:28,536 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-17 01:29:28,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:28,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -334882456, now seen corresponding path program 1 times [2025-03-17 01:29:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:28,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140170732] [2025-03-17 01:29:28,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:28,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:28,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:28,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:28,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:28,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:29,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140170732] [2025-03-17 01:29:29,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140170732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319698355] [2025-03-17 01:29:29,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:29,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:29,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:29,086 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-17 01:29:29,087 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-17 01:29:29,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:29,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:29,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:29,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:29,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 01:29:29,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 309 proven. 150 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 01:29:30,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:29:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:30,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319698355] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:30,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:29:30,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 20] total 32 [2025-03-17 01:29:30,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689359734] [2025-03-17 01:29:30,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:30,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:29:30,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:30,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:29:30,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2025-03-17 01:29:30,931 INFO L87 Difference]: Start difference. First operand 414 states and 618 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:33,259 INFO L93 Difference]: Finished difference Result 1391 states and 2085 transitions. [2025-03-17 01:29:33,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:29:33,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2025-03-17 01:29:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:33,263 INFO L225 Difference]: With dead ends: 1391 [2025-03-17 01:29:33,263 INFO L226 Difference]: Without dead ends: 978 [2025-03-17 01:29:33,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 01:29:33,264 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 333 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:33,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 819 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 01:29:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-17 01:29:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 402. [2025-03-17 01:29:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 363 states have (on average 1.4820936639118458) internal successors, (538), 364 states have internal predecessors, (538), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:29:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 602 transitions. [2025-03-17 01:29:33,284 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 602 transitions. Word has length 135 [2025-03-17 01:29:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:33,284 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 602 transitions. [2025-03-17 01:29:33,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 602 transitions. [2025-03-17 01:29:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 01:29:33,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:33,286 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1] [2025-03-17 01:29:33,293 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-17 01:29:33,486 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-17 01:29:33,487 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:33,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:33,487 INFO L85 PathProgramCache]: Analyzing trace with hash 726696225, now seen corresponding path program 1 times [2025-03-17 01:29:33,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:33,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283938663] [2025-03-17 01:29:33,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:33,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:33,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:33,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:33,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:33,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283938663] [2025-03-17 01:29:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283938663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868939102] [2025-03-17 01:29:34,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:34,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:34,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:34,222 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-17 01:29:34,223 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-17 01:29:34,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 01:29:34,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 01:29:34,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:34,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:34,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 01:29:34,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:34,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:29:34,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868939102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:34,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:29:34,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2025-03-17 01:29:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345652805] [2025-03-17 01:29:34,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:34,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:29:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:34,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:29:34,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:29:34,745 INFO L87 Difference]: Start difference. First operand 402 states and 602 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:35,406 INFO L93 Difference]: Finished difference Result 1056 states and 1579 transitions. [2025-03-17 01:29:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 01:29:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2025-03-17 01:29:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:35,409 INFO L225 Difference]: With dead ends: 1056 [2025-03-17 01:29:35,409 INFO L226 Difference]: Without dead ends: 655 [2025-03-17 01:29:35,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:29:35,410 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 142 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:35,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 777 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:29:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-17 01:29:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 353. [2025-03-17 01:29:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 314 states have (on average 1.464968152866242) internal successors, (460), 315 states have internal predecessors, (460), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:29:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 524 transitions. [2025-03-17 01:29:35,426 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 524 transitions. Word has length 135 [2025-03-17 01:29:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:35,426 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 524 transitions. [2025-03-17 01:29:35,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 524 transitions. [2025-03-17 01:29:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 01:29:35,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:35,428 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1, 1, 1] [2025-03-17 01:29:35,434 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-17 01:29:35,628 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-17 01:29:35,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:35,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:35,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1498822490, now seen corresponding path program 1 times [2025-03-17 01:29:35,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:35,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041432748] [2025-03-17 01:29:35,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:35,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:35,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 01:29:35,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 01:29:35,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:35,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:29:35,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380775294] [2025-03-17 01:29:35,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:35,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:35,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:35,672 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-17 01:29:35,674 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-17 01:29:35,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 01:29:35,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 01:29:35,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:35,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:35,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 01:29:35,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 268 proven. 42 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2025-03-17 01:29:36,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:29:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:36,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041432748] [2025-03-17 01:29:36,311 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 01:29:36,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380775294] [2025-03-17 01:29:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380775294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:29:36,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:29:36,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-03-17 01:29:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901256062] [2025-03-17 01:29:36,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:29:36,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 01:29:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:36,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 01:29:36,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:29:36,312 INFO L87 Difference]: Start difference. First operand 353 states and 524 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-17 01:29:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:37,170 INFO L93 Difference]: Finished difference Result 970 states and 1405 transitions. [2025-03-17 01:29:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 01:29:37,171 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 137 [2025-03-17 01:29:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:37,173 INFO L225 Difference]: With dead ends: 970 [2025-03-17 01:29:37,173 INFO L226 Difference]: Without dead ends: 618 [2025-03-17 01:29:37,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2025-03-17 01:29:37,174 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 638 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:37,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 694 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:29:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-03-17 01:29:37,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 372. [2025-03-17 01:29:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 331 states have (on average 1.4531722054380665) internal successors, (481), 332 states have internal predecessors, (481), 32 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:29:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 545 transitions. [2025-03-17 01:29:37,191 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 545 transitions. Word has length 137 [2025-03-17 01:29:37,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:37,191 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 545 transitions. [2025-03-17 01:29:37,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-17 01:29:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 545 transitions. [2025-03-17 01:29:37,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 01:29:37,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:37,192 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1, 1, 1] [2025-03-17 01:29:37,202 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-17 01:29:37,397 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-17 01:29:37,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:37,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:37,397 INFO L85 PathProgramCache]: Analyzing trace with hash 771040799, now seen corresponding path program 1 times [2025-03-17 01:29:37,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:37,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429831559] [2025-03-17 01:29:37,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:37,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 01:29:37,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 01:29:37,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:37,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:37,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:37,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429831559] [2025-03-17 01:29:37,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429831559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:37,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:29:37,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:29:37,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514460968] [2025-03-17 01:29:37,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:37,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:29:37,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:37,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:29:37,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:29:37,448 INFO L87 Difference]: Start difference. First operand 372 states and 545 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:37,530 INFO L93 Difference]: Finished difference Result 850 states and 1230 transitions. [2025-03-17 01:29:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:29:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-03-17 01:29:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:37,533 INFO L225 Difference]: With dead ends: 850 [2025-03-17 01:29:37,533 INFO L226 Difference]: Without dead ends: 479 [2025-03-17 01:29:37,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:29:37,534 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 113 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:37,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 247 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:29:37,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-17 01:29:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 372. [2025-03-17 01:29:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 331 states have (on average 1.4350453172205437) internal successors, (475), 332 states have internal predecessors, (475), 32 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:29:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 539 transitions. [2025-03-17 01:29:37,551 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 539 transitions. Word has length 137 [2025-03-17 01:29:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:37,552 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 539 transitions. [2025-03-17 01:29:37,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 539 transitions. [2025-03-17 01:29:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 01:29:37,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:37,553 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1, 1, 1] [2025-03-17 01:29:37,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 01:29:37,553 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:37,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:37,554 INFO L85 PathProgramCache]: Analyzing trace with hash 994066785, now seen corresponding path program 1 times [2025-03-17 01:29:37,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:37,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884050186] [2025-03-17 01:29:37,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:37,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:37,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 01:29:37,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 01:29:37,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:37,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:38,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:38,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884050186] [2025-03-17 01:29:38,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884050186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:38,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:29:38,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 01:29:38,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074175045] [2025-03-17 01:29:38,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:38,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:29:38,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:38,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:29:38,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:29:38,059 INFO L87 Difference]: Start difference. First operand 372 states and 539 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 01:29:38,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:38,680 INFO L93 Difference]: Finished difference Result 1338 states and 1892 transitions. [2025-03-17 01:29:38,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:29:38,681 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 137 [2025-03-17 01:29:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:38,684 INFO L225 Difference]: With dead ends: 1338 [2025-03-17 01:29:38,684 INFO L226 Difference]: Without dead ends: 967 [2025-03-17 01:29:38,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:29:38,685 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 413 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:38,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 441 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:29:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-03-17 01:29:38,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 708. [2025-03-17 01:29:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 637 states have (on average 1.433281004709576) internal successors, (913), 640 states have internal predecessors, (913), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 01:29:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1021 transitions. [2025-03-17 01:29:38,720 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1021 transitions. Word has length 137 [2025-03-17 01:29:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:38,720 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1021 transitions. [2025-03-17 01:29:38,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 01:29:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1021 transitions. [2025-03-17 01:29:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 01:29:38,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:38,722 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1, 1, 1] [2025-03-17 01:29:38,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 01:29:38,722 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:38,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1955680802, now seen corresponding path program 1 times [2025-03-17 01:29:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:38,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677139915] [2025-03-17 01:29:38,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:38,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 01:29:38,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 01:29:38,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:38,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:39,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:39,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677139915] [2025-03-17 01:29:39,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677139915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:39,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494359678] [2025-03-17 01:29:39,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:39,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:39,047 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-17 01:29:39,049 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-17 01:29:39,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 01:29:39,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 01:29:39,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:39,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:39,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 01:29:39,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:39,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:29:39,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494359678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:39,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:29:39,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2025-03-17 01:29:39,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841598725] [2025-03-17 01:29:39,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:39,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:29:39,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:39,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:29:39,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:29:39,235 INFO L87 Difference]: Start difference. First operand 708 states and 1021 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:39,440 INFO L93 Difference]: Finished difference Result 1658 states and 2363 transitions. [2025-03-17 01:29:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:29:39,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-03-17 01:29:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:39,443 INFO L225 Difference]: With dead ends: 1658 [2025-03-17 01:29:39,443 INFO L226 Difference]: Without dead ends: 951 [2025-03-17 01:29:39,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:29:39,446 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 37 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:39,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 510 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:29:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-17 01:29:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 730. [2025-03-17 01:29:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 659 states have (on average 1.4279210925644916) internal successors, (941), 662 states have internal predecessors, (941), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 01:29:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1049 transitions. [2025-03-17 01:29:39,486 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1049 transitions. Word has length 137 [2025-03-17 01:29:39,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:39,487 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1049 transitions. [2025-03-17 01:29:39,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:39,487 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1049 transitions. [2025-03-17 01:29:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 01:29:39,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:39,488 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-17 01:29:39,495 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-17 01:29:39,689 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,SelfDestructingSolverStorable15 [2025-03-17 01:29:39,689 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:39,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash 534737149, now seen corresponding path program 1 times [2025-03-17 01:29:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:39,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828383380] [2025-03-17 01:29:39,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:39,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:39,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 01:29:39,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 01:29:39,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:39,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:41,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828383380] [2025-03-17 01:29:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828383380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:41,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:29:41,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:29:41,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774309875] [2025-03-17 01:29:41,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:41,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:29:41,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:41,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:29:41,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:29:41,093 INFO L87 Difference]: Start difference. First operand 730 states and 1049 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:42,775 INFO L93 Difference]: Finished difference Result 2389 states and 3423 transitions. [2025-03-17 01:29:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 01:29:42,776 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-03-17 01:29:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:42,780 INFO L225 Difference]: With dead ends: 2389 [2025-03-17 01:29:42,780 INFO L226 Difference]: Without dead ends: 1660 [2025-03-17 01:29:42,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:29:42,782 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 684 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:42,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 663 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:29:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-17 01:29:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 865. [2025-03-17 01:29:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 794 states have (on average 1.4168765743073048) internal successors, (1125), 797 states have internal predecessors, (1125), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 01:29:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1233 transitions. [2025-03-17 01:29:42,818 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1233 transitions. Word has length 138 [2025-03-17 01:29:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:42,818 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1233 transitions. [2025-03-17 01:29:42,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1233 transitions. [2025-03-17 01:29:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 01:29:42,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:42,820 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-17 01:29:42,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 01:29:42,820 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:42,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1749893467, now seen corresponding path program 1 times [2025-03-17 01:29:42,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:42,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203736245] [2025-03-17 01:29:42,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:42,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 01:29:42,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 01:29:42,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:42,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:45,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:45,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203736245] [2025-03-17 01:29:45,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203736245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:45,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955672387] [2025-03-17 01:29:45,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:45,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:45,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:45,308 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-17 01:29:45,309 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-17 01:29:45,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 01:29:45,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 01:29:45,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:45,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:45,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:29:45,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-03-17 01:29:45,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:29:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:29:45,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955672387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:29:45,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:29:45,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 18 [2025-03-17 01:29:45,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486928637] [2025-03-17 01:29:45,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:29:45,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 01:29:45,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:45,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 01:29:45,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-17 01:29:45,734 INFO L87 Difference]: Start difference. First operand 865 states and 1233 transitions. Second operand has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-17 01:29:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:48,080 INFO L93 Difference]: Finished difference Result 3324 states and 4712 transitions. [2025-03-17 01:29:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 01:29:48,097 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 138 [2025-03-17 01:29:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:48,107 INFO L225 Difference]: With dead ends: 3324 [2025-03-17 01:29:48,108 INFO L226 Difference]: Without dead ends: 2406 [2025-03-17 01:29:48,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2025-03-17 01:29:48,110 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 1269 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:48,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 607 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 01:29:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2025-03-17 01:29:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 1175. [2025-03-17 01:29:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1100 states have (on average 1.4063636363636363) internal successors, (1547), 1103 states have internal predecessors, (1547), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 01:29:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1655 transitions. [2025-03-17 01:29:48,153 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1655 transitions. Word has length 138 [2025-03-17 01:29:48,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:48,153 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1655 transitions. [2025-03-17 01:29:48,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-17 01:29:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1655 transitions. [2025-03-17 01:29:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 01:29:48,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:48,155 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-17 01:29:48,162 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-17 01:29:48,355 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,SelfDestructingSolverStorable17 [2025-03-17 01:29:48,356 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:48,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash -354122332, now seen corresponding path program 1 times [2025-03-17 01:29:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:48,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818336791] [2025-03-17 01:29:48,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:48,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 01:29:48,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 01:29:48,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:48,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:29:48,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:48,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818336791] [2025-03-17 01:29:48,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818336791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:48,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:29:48,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:29:48,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977235663] [2025-03-17 01:29:48,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:48,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:29:48,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:48,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:29:48,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:29:48,407 INFO L87 Difference]: Start difference. First operand 1175 states and 1655 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:48,478 INFO L93 Difference]: Finished difference Result 2594 states and 3664 transitions. [2025-03-17 01:29:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:29:48,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-03-17 01:29:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:48,484 INFO L225 Difference]: With dead ends: 2594 [2025-03-17 01:29:48,484 INFO L226 Difference]: Without dead ends: 1420 [2025-03-17 01:29:48,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:29:48,486 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:48,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 250 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:29:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-03-17 01:29:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1234. [2025-03-17 01:29:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1159 states have (on average 1.4176013805004315) internal successors, (1643), 1162 states have internal predecessors, (1643), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 01:29:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1751 transitions. [2025-03-17 01:29:48,534 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1751 transitions. Word has length 138 [2025-03-17 01:29:48,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:48,535 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1751 transitions. [2025-03-17 01:29:48,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:29:48,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1751 transitions. [2025-03-17 01:29:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 01:29:48,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:48,537 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-17 01:29:48,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 01:29:48,537 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:48,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1167571203, now seen corresponding path program 1 times [2025-03-17 01:29:48,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022672298] [2025-03-17 01:29:48,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:48,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 01:29:48,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 01:29:48,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:48,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:29:48,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425025323] [2025-03-17 01:29:48,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:48,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:48,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:48,572 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-17 01:29:48,574 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-17 01:29:48,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 01:29:48,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 01:29:48,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:48,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:48,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 01:29:48,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 308 proven. 72 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-17 01:29:49,308 INFO L312 TraceCheckSpWp]: Computing backward predicates...