./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:46:13,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:46:13,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:46:13,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:46:13,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:46:13,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:46:13,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:46:13,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:46:13,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:46:13,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:46:13,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:46:13,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:46:13,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:46:13,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:46:13,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:46:13,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:46:13,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:46:13,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:46:13,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:46:13,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:46:13,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:46:13,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:46:13,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:46:13,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:46:13,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:46:13,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:46:13,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:46:13,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:46:13,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:46:13,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:46:13,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:46:13,892 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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2025-03-03 14:46:14,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:46:14,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:46:14,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:46:14,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:46:14,137 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:46:14,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:46:15,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04cd1ddc2/29106d8c94e14a0e93de5b62a233d2fa/FLAG53a73a90a [2025-03-03 14:46:15,531 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:46:15,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:46:15,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04cd1ddc2/29106d8c94e14a0e93de5b62a233d2fa/FLAG53a73a90a [2025-03-03 14:46:15,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04cd1ddc2/29106d8c94e14a0e93de5b62a233d2fa [2025-03-03 14:46:15,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:46:15,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:46:15,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:46:15,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:46:15,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:46:15,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ae41ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15, skipping insertion in model container [2025-03-03 14:46:15,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:46:15,750 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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2025-03-03 14:46:15,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:46:15,759 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:46:15,797 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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2025-03-03 14:46:15,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:46:15,813 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:46:15,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15 WrapperNode [2025-03-03 14:46:15,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:46:15,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:46:15,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:46:15,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:46:15,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,846 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 416 [2025-03-03 14:46:15,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:46:15,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:46:15,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:46:15,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:46:15,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,868 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-03 14:46:15,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:46:15,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:46:15,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:46:15,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:46:15,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (1/1) ... [2025-03-03 14:46:15,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:46:15,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:15,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:46:15,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:46:15,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:46:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-03-03 14:46:15,935 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-03-03 14:46:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-03 14:46:15,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-03 14:46:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-03-03 14:46:15,935 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-03-03 14:46:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-03-03 14:46:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-03-03 14:46:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-03-03 14:46:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-03-03 14:46:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 14:46:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 14:46:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:46:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:46:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:46:16,028 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:46:16,030 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:46:16,530 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-03-03 14:46:16,530 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:46:16,546 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:46:16,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:46:16,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:46:16 BoogieIcfgContainer [2025-03-03 14:46:16,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:46:16,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:46:16,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:46:16,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:46:16,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:46:15" (1/3) ... [2025-03-03 14:46:16,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361ce7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:46:16, skipping insertion in model container [2025-03-03 14:46:16,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:15" (2/3) ... [2025-03-03 14:46:16,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361ce7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:46:16, skipping insertion in model container [2025-03-03 14:46:16,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:46:16" (3/3) ... [2025-03-03 14:46:16,554 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:46:16,567 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:46:16,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c that has 7 procedures, 176 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 14:46:16,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:46:16,626 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;@7089edad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:46:16,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:46:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 131 states have (on average 1.5801526717557253) internal successors, (207), 136 states have internal predecessors, (207), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 14:46:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 14:46:16,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:16,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:16,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:16,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1088250477, now seen corresponding path program 1 times [2025-03-03 14:46:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:16,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134026757] [2025-03-03 14:46:16,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:16,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 14:46:16,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 14:46:16,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:16,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:16,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:16,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134026757] [2025-03-03 14:46:16,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134026757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:16,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:16,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378579900] [2025-03-03 14:46:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:16,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:16,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:16,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:16,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:16,921 INFO L87 Difference]: Start difference. First operand has 176 states, 131 states have (on average 1.5801526717557253) internal successors, (207), 136 states have internal predecessors, (207), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:17,010 INFO L93 Difference]: Finished difference Result 352 states and 601 transitions. [2025-03-03 14:46:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:17,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 14:46:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:17,017 INFO L225 Difference]: With dead ends: 352 [2025-03-03 14:46:17,017 INFO L226 Difference]: Without dead ends: 179 [2025-03-03 14:46:17,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:17,024 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 7 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:17,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 800 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-03 14:46:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-03 14:46:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 134 states have (on average 1.5597014925373134) internal successors, (209), 138 states have internal predecessors, (209), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 14:46:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 283 transitions. [2025-03-03 14:46:17,070 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 283 transitions. Word has length 15 [2025-03-03 14:46:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:17,071 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 283 transitions. [2025-03-03 14:46:17,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 283 transitions. [2025-03-03 14:46:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 14:46:17,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:17,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:17,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:46:17,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:17,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1751837251, now seen corresponding path program 1 times [2025-03-03 14:46:17,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:17,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24350812] [2025-03-03 14:46:17,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:17,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:46:17,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:46:17,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:17,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24350812] [2025-03-03 14:46:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24350812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:17,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:17,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:17,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968003995] [2025-03-03 14:46:17,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:17,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:17,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:17,175 INFO L87 Difference]: Start difference. First operand 179 states and 283 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:17,228 INFO L93 Difference]: Finished difference Result 369 states and 587 transitions. [2025-03-03 14:46:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 14:46:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:17,234 INFO L225 Difference]: With dead ends: 369 [2025-03-03 14:46:17,234 INFO L226 Difference]: Without dead ends: 193 [2025-03-03 14:46:17,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:17,235 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 22 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:17,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 818 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-03 14:46:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-03-03 14:46:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 144 states have (on average 1.5416666666666667) internal successors, (222), 148 states have internal predecessors, (222), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:46:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2025-03-03 14:46:17,254 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 16 [2025-03-03 14:46:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:17,254 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2025-03-03 14:46:17,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2025-03-03 14:46:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:46:17,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:17,256 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:17,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:46:17,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:17,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1969301919, now seen corresponding path program 1 times [2025-03-03 14:46:17,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:17,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65950336] [2025-03-03 14:46:17,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:17,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:17,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:46:17,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:46:17,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:17,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:17,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:17,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65950336] [2025-03-03 14:46:17,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65950336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:17,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:17,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589554899] [2025-03-03 14:46:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:17,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:17,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:17,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:17,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:17,356 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:46:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:17,375 INFO L93 Difference]: Finished difference Result 401 states and 633 transitions. [2025-03-03 14:46:17,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:17,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-03 14:46:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:17,378 INFO L225 Difference]: With dead ends: 401 [2025-03-03 14:46:17,378 INFO L226 Difference]: Without dead ends: 220 [2025-03-03 14:46:17,378 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-03 14:46:17,379 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 22 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:17,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 548 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-03 14:46:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 193. [2025-03-03 14:46:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 150 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:46:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2025-03-03 14:46:17,391 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 23 [2025-03-03 14:46:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:17,391 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2025-03-03 14:46:17,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:46:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2025-03-03 14:46:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 14:46:17,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:17,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:17,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:46:17,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:17,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:17,392 INFO L85 PathProgramCache]: Analyzing trace with hash -586142999, now seen corresponding path program 1 times [2025-03-03 14:46:17,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:17,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287732992] [2025-03-03 14:46:17,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:17,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:17,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 14:46:17,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 14:46:17,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:17,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:17,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287732992] [2025-03-03 14:46:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287732992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:17,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:17,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402199605] [2025-03-03 14:46:17,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:17,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:17,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:17,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:17,528 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:17,564 INFO L93 Difference]: Finished difference Result 377 states and 590 transitions. [2025-03-03 14:46:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:17,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-03 14:46:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:17,566 INFO L225 Difference]: With dead ends: 377 [2025-03-03 14:46:17,567 INFO L226 Difference]: Without dead ends: 199 [2025-03-03 14:46:17,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:17,569 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:17,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-03 14:46:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2025-03-03 14:46:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 149 states have (on average 1.523489932885906) internal successors, (227), 153 states have internal predecessors, (227), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-03 14:46:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 304 transitions. [2025-03-03 14:46:17,583 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 304 transitions. Word has length 32 [2025-03-03 14:46:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:17,583 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 304 transitions. [2025-03-03 14:46:17,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 304 transitions. [2025-03-03 14:46:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 14:46:17,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:17,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:17,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:46:17,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:17,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:17,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1592030103, now seen corresponding path program 1 times [2025-03-03 14:46:17,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:17,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733370266] [2025-03-03 14:46:17,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:17,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:46:17,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:46:17,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:17,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:17,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:17,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733370266] [2025-03-03 14:46:17,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733370266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:17,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071183421] [2025-03-03 14:46:17,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:17,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:17,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:17,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:17,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:46:17,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:46:17,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:46:17,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:17,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:17,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:17,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:17,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:17,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071183421] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:17,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:17,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 14:46:17,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991303297] [2025-03-03 14:46:17,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:17,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:17,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:17,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:17,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:17,849 INFO L87 Difference]: Start difference. First operand 197 states and 304 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:46:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:17,904 INFO L93 Difference]: Finished difference Result 442 states and 696 transitions. [2025-03-03 14:46:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:17,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2025-03-03 14:46:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:17,906 INFO L225 Difference]: With dead ends: 442 [2025-03-03 14:46:17,908 INFO L226 Difference]: Without dead ends: 260 [2025-03-03 14:46:17,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:17,910 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 91 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:17,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 591 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-03 14:46:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 250. [2025-03-03 14:46:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 192 states have (on average 1.5) internal successors, (288), 196 states have internal predecessors, (288), 48 states have call successors, (48), 8 states have call predecessors, (48), 9 states have return successors, (49), 49 states have call predecessors, (49), 48 states have call successors, (49) [2025-03-03 14:46:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 385 transitions. [2025-03-03 14:46:17,927 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 385 transitions. Word has length 34 [2025-03-03 14:46:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:17,927 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 385 transitions. [2025-03-03 14:46:17,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:46:17,927 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 385 transitions. [2025-03-03 14:46:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 14:46:17,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:17,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:17,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:46:18,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:18,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:18,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:18,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1861246826, now seen corresponding path program 1 times [2025-03-03 14:46:18,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:18,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175379491] [2025-03-03 14:46:18,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:18,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:18,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 14:46:18,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 14:46:18,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:18,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:18,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:18,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175379491] [2025-03-03 14:46:18,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175379491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:18,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:18,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:46:18,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414621732] [2025-03-03 14:46:18,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:18,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:18,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:18,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:18,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:18,236 INFO L87 Difference]: Start difference. First operand 250 states and 385 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:46:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:18,289 INFO L93 Difference]: Finished difference Result 394 states and 613 transitions. [2025-03-03 14:46:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:46:18,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-03-03 14:46:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:18,291 INFO L225 Difference]: With dead ends: 394 [2025-03-03 14:46:18,291 INFO L226 Difference]: Without dead ends: 246 [2025-03-03 14:46:18,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:18,292 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:18,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1325 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-03 14:46:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-03-03 14:46:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 189 states have (on average 1.470899470899471) internal successors, (278), 193 states have internal predecessors, (278), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 14:46:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 374 transitions. [2025-03-03 14:46:18,305 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 374 transitions. Word has length 35 [2025-03-03 14:46:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:18,305 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 374 transitions. [2025-03-03 14:46:18,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:46:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 374 transitions. [2025-03-03 14:46:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:46:18,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:18,306 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:18,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:46:18,306 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:18,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash -734314135, now seen corresponding path program 2 times [2025-03-03 14:46:18,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:18,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942823109] [2025-03-03 14:46:18,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:46:18,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:18,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-03 14:46:18,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 56 statements. [2025-03-03 14:46:18,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:46:18,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 14:46:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942823109] [2025-03-03 14:46:18,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942823109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:18,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:18,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:18,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775139932] [2025-03-03 14:46:18,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:18,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:18,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:18,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:18,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:18,345 INFO L87 Difference]: Start difference. First operand 246 states and 374 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:18,391 INFO L93 Difference]: Finished difference Result 462 states and 727 transitions. [2025-03-03 14:46:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:18,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-03-03 14:46:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:18,394 INFO L225 Difference]: With dead ends: 462 [2025-03-03 14:46:18,395 INFO L226 Difference]: Without dead ends: 244 [2025-03-03 14:46:18,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:18,397 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 7 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:18,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 753 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-03 14:46:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-03 14:46:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 192 states have internal predecessors, (276), 47 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-03 14:46:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 370 transitions. [2025-03-03 14:46:18,413 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 370 transitions. Word has length 56 [2025-03-03 14:46:18,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:18,413 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 370 transitions. [2025-03-03 14:46:18,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 370 transitions. [2025-03-03 14:46:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:46:18,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:18,416 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:18,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:46:18,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:18,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:18,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1795771519, now seen corresponding path program 1 times [2025-03-03 14:46:18,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:18,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558617565] [2025-03-03 14:46:18,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:18,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:18,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:46:18,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:46:18,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:18,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 14:46:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:18,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558617565] [2025-03-03 14:46:18,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558617565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:18,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:18,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699708923] [2025-03-03 14:46:18,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:18,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:18,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:18,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:18,490 INFO L87 Difference]: Start difference. First operand 244 states and 370 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:18,540 INFO L93 Difference]: Finished difference Result 467 states and 725 transitions. [2025-03-03 14:46:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:18,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-03-03 14:46:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:18,543 INFO L225 Difference]: With dead ends: 467 [2025-03-03 14:46:18,544 INFO L226 Difference]: Without dead ends: 251 [2025-03-03 14:46:18,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:18,545 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 8 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:18,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 778 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-03 14:46:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-03 14:46:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 198 states have internal predecessors, (284), 47 states have call successors, (47), 9 states have call predecessors, (47), 9 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-03 14:46:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 378 transitions. [2025-03-03 14:46:18,557 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 378 transitions. Word has length 56 [2025-03-03 14:46:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:18,558 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 378 transitions. [2025-03-03 14:46:18,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 378 transitions. [2025-03-03 14:46:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:46:18,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:18,559 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:18,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:46:18,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:18,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:18,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1592290681, now seen corresponding path program 1 times [2025-03-03 14:46:18,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:18,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157581036] [2025-03-03 14:46:18,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:18,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:46:18,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:46:18,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:18,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:46:18,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:18,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157581036] [2025-03-03 14:46:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157581036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:18,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:18,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:18,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279161480] [2025-03-03 14:46:18,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:18,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:18,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:18,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:18,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:18,617 INFO L87 Difference]: Start difference. First operand 251 states and 378 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:18,651 INFO L93 Difference]: Finished difference Result 511 states and 781 transitions. [2025-03-03 14:46:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:18,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-03-03 14:46:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:18,653 INFO L225 Difference]: With dead ends: 511 [2025-03-03 14:46:18,653 INFO L226 Difference]: Without dead ends: 288 [2025-03-03 14:46:18,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:18,655 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 22 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:18,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 793 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-03 14:46:18,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2025-03-03 14:46:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 225 states have (on average 1.4222222222222223) internal successors, (320), 229 states have internal predecessors, (320), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:46:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 420 transitions. [2025-03-03 14:46:18,667 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 420 transitions. Word has length 57 [2025-03-03 14:46:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:18,667 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 420 transitions. [2025-03-03 14:46:18,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 420 transitions. [2025-03-03 14:46:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:46:18,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:18,668 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:18,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:46:18,668 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:18,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash 610717128, now seen corresponding path program 1 times [2025-03-03 14:46:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:18,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939920305] [2025-03-03 14:46:18,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:18,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:18,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:46:18,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:46:18,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:18,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-03 14:46:18,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939920305] [2025-03-03 14:46:18,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939920305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:18,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:18,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567269364] [2025-03-03 14:46:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:18,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:18,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:18,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:18,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:18,757 INFO L87 Difference]: Start difference. First operand 286 states and 420 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:18,798 INFO L93 Difference]: Finished difference Result 523 states and 781 transitions. [2025-03-03 14:46:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:18,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2025-03-03 14:46:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:18,802 INFO L225 Difference]: With dead ends: 523 [2025-03-03 14:46:18,802 INFO L226 Difference]: Without dead ends: 288 [2025-03-03 14:46:18,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:18,804 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:18,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1061 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-03 14:46:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2025-03-03 14:46:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 225 states have (on average 1.4088888888888889) internal successors, (317), 229 states have internal predecessors, (317), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:46:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 417 transitions. [2025-03-03 14:46:18,831 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 417 transitions. Word has length 75 [2025-03-03 14:46:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:18,831 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 417 transitions. [2025-03-03 14:46:18,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 417 transitions. [2025-03-03 14:46:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:46:18,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:18,832 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:18,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:46:18,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:18,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -764366104, now seen corresponding path program 1 times [2025-03-03 14:46:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982313836] [2025-03-03 14:46:18,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:18,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:46:18,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:46:18,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:18,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-03 14:46:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982313836] [2025-03-03 14:46:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982313836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:18,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:18,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989872529] [2025-03-03 14:46:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:18,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:18,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:18,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:18,925 INFO L87 Difference]: Start difference. First operand 286 states and 417 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:18,966 INFO L93 Difference]: Finished difference Result 510 states and 765 transitions. [2025-03-03 14:46:18,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:18,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2025-03-03 14:46:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:18,969 INFO L225 Difference]: With dead ends: 510 [2025-03-03 14:46:18,969 INFO L226 Difference]: Without dead ends: 280 [2025-03-03 14:46:18,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:18,970 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 9 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:18,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 761 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-03 14:46:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-03 14:46:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 220 states have (on average 1.3863636363636365) internal successors, (305), 224 states have internal predecessors, (305), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:46:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 403 transitions. [2025-03-03 14:46:18,983 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 403 transitions. Word has length 103 [2025-03-03 14:46:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:18,983 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 403 transitions. [2025-03-03 14:46:18,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 403 transitions. [2025-03-03 14:46:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:46:18,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:18,985 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:18,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:46:18,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:18,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -353924808, now seen corresponding path program 1 times [2025-03-03 14:46:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:18,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974250617] [2025-03-03 14:46:18,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:18,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:18,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:46:19,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:46:19,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:19,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 14:46:19,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:19,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974250617] [2025-03-03 14:46:19,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974250617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:19,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201019210] [2025-03-03 14:46:19,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:19,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:19,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:19,079 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:19,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:46:19,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:46:19,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:46:19,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:19,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:19,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:19,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 14:46:19,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:19,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201019210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:19,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:19,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:46:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635729729] [2025-03-03 14:46:19,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:19,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:19,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:19,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:19,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:19,235 INFO L87 Difference]: Start difference. First operand 280 states and 403 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:46:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:19,280 INFO L93 Difference]: Finished difference Result 506 states and 744 transitions. [2025-03-03 14:46:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 137 [2025-03-03 14:46:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:19,282 INFO L225 Difference]: With dead ends: 506 [2025-03-03 14:46:19,282 INFO L226 Difference]: Without dead ends: 263 [2025-03-03 14:46:19,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:19,284 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 32 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:19,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 718 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-03 14:46:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-03 14:46:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 206 states have (on average 1.3786407766990292) internal successors, (284), 210 states have internal predecessors, (284), 46 states have call successors, (46), 10 states have call predecessors, (46), 10 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 14:46:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 376 transitions. [2025-03-03 14:46:19,297 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 376 transitions. Word has length 137 [2025-03-03 14:46:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:19,297 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 376 transitions. [2025-03-03 14:46:19,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:46:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 376 transitions. [2025-03-03 14:46:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 14:46:19,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:19,299 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:19,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:46:19,499 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,SelfDestructingSolverStorable11 [2025-03-03 14:46:19,500 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:19,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1540338194, now seen corresponding path program 1 times [2025-03-03 14:46:19,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:19,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551270833] [2025-03-03 14:46:19,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:19,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:19,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:46:19,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:46:19,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:19,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-03 14:46:19,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551270833] [2025-03-03 14:46:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551270833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847860778] [2025-03-03 14:46:19,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:19,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:19,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:19,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:46:19,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:46:19,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:46:19,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:19,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:19,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:19,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-03-03 14:46:19,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847860778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:19,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:19,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:46:19,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951954955] [2025-03-03 14:46:19,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:19,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:19,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:19,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:19,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:19,746 INFO L87 Difference]: Start difference. First operand 263 states and 376 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:46:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:19,796 INFO L93 Difference]: Finished difference Result 472 states and 690 transitions. [2025-03-03 14:46:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:19,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 141 [2025-03-03 14:46:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:19,798 INFO L225 Difference]: With dead ends: 472 [2025-03-03 14:46:19,799 INFO L226 Difference]: Without dead ends: 244 [2025-03-03 14:46:19,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:19,800 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 34 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:19,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 714 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-03 14:46:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-03 14:46:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 190 states have (on average 1.3736842105263158) internal successors, (261), 194 states have internal predecessors, (261), 43 states have call successors, (43), 10 states have call predecessors, (43), 10 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 14:46:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 347 transitions. [2025-03-03 14:46:19,809 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 347 transitions. Word has length 141 [2025-03-03 14:46:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:19,810 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 347 transitions. [2025-03-03 14:46:19,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:46:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 347 transitions. [2025-03-03 14:46:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:46:19,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:19,812 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:19,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:46:20,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:20,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:20,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:20,015 INFO L85 PathProgramCache]: Analyzing trace with hash 270179104, now seen corresponding path program 1 times [2025-03-03 14:46:20,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:20,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784208807] [2025-03-03 14:46:20,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:20,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:20,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 14:46:20,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:46:20,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:20,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-03 14:46:20,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:20,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784208807] [2025-03-03 14:46:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784208807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:20,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219027871] [2025-03-03 14:46:20,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:20,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:20,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:20,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:20,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:46:20,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 14:46:20,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:46:20,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:20,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:20,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:20,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-03 14:46:20,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:20,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219027871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:20,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:46:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513932390] [2025-03-03 14:46:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:20,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:20,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:20,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:20,258 INFO L87 Difference]: Start difference. First operand 244 states and 347 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:46:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:20,322 INFO L93 Difference]: Finished difference Result 463 states and 673 transitions. [2025-03-03 14:46:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:20,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 144 [2025-03-03 14:46:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:20,324 INFO L225 Difference]: With dead ends: 463 [2025-03-03 14:46:20,324 INFO L226 Difference]: Without dead ends: 275 [2025-03-03 14:46:20,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:20,325 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 31 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:20,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 726 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-03 14:46:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-03 14:46:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 217 states have (on average 1.3732718894009217) internal successors, (298), 221 states have internal predecessors, (298), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 14:46:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 390 transitions. [2025-03-03 14:46:20,339 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 390 transitions. Word has length 144 [2025-03-03 14:46:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:20,339 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 390 transitions. [2025-03-03 14:46:20,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:46:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 390 transitions. [2025-03-03 14:46:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:46:20,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:20,343 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:20,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:46:20,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:20,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:20,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash 208628424, now seen corresponding path program 2 times [2025-03-03 14:46:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002739329] [2025-03-03 14:46:20,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:46:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:20,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-03 14:46:20,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 144 statements. [2025-03-03 14:46:20,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:46:20,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 14:46:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002739329] [2025-03-03 14:46:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002739329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68193186] [2025-03-03 14:46:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:20,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:20,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:20,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:20,591 INFO L87 Difference]: Start difference. First operand 275 states and 390 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 14:46:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:20,618 INFO L93 Difference]: Finished difference Result 419 states and 609 transitions. [2025-03-03 14:46:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:20,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 144 [2025-03-03 14:46:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:20,620 INFO L225 Difference]: With dead ends: 419 [2025-03-03 14:46:20,621 INFO L226 Difference]: Without dead ends: 279 [2025-03-03 14:46:20,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:20,622 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:20,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 770 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-03 14:46:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-03-03 14:46:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 220 states have (on average 1.3681818181818182) internal successors, (301), 224 states have internal predecessors, (301), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 14:46:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 393 transitions. [2025-03-03 14:46:20,641 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 393 transitions. Word has length 144 [2025-03-03 14:46:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:20,642 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 393 transitions. [2025-03-03 14:46:20,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 14:46:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 393 transitions. [2025-03-03 14:46:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:46:20,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:20,643 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:20,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:46:20,643 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:20,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1707560964, now seen corresponding path program 1 times [2025-03-03 14:46:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:20,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063836206] [2025-03-03 14:46:20,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:20,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:46:20,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:46:20,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:20,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-03 14:46:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:20,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063836206] [2025-03-03 14:46:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063836206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163419577] [2025-03-03 14:46:20,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:20,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:20,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:20,736 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:20,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:46:20,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:46:20,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:46:20,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:20,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:20,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:20,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 14:46:20,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:20,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163419577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:20,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:20,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-03 14:46:20,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589501285] [2025-03-03 14:46:20,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:20,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:20,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:20,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:20,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:20,897 INFO L87 Difference]: Start difference. First operand 279 states and 393 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 14:46:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:20,923 INFO L93 Difference]: Finished difference Result 428 states and 617 transitions. [2025-03-03 14:46:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 151 [2025-03-03 14:46:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:20,926 INFO L225 Difference]: With dead ends: 428 [2025-03-03 14:46:20,926 INFO L226 Difference]: Without dead ends: 284 [2025-03-03 14:46:20,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:20,926 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 4 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:20,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 772 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-03 14:46:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-03 14:46:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 224 states have (on average 1.3616071428571428) internal successors, (305), 228 states have internal predecessors, (305), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 14:46:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 397 transitions. [2025-03-03 14:46:20,936 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 397 transitions. Word has length 151 [2025-03-03 14:46:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:20,937 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 397 transitions. [2025-03-03 14:46:20,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 14:46:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 397 transitions. [2025-03-03 14:46:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 14:46:20,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:20,938 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:20,946 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-03 14:46:21,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:46:21,139 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:21,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1662482703, now seen corresponding path program 1 times [2025-03-03 14:46:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078394480] [2025-03-03 14:46:21,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:21,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:21,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:46:21,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:46:21,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:21,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-03 14:46:21,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:21,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078394480] [2025-03-03 14:46:21,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078394480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:21,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731352993] [2025-03-03 14:46:21,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:21,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:21,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:21,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:21,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:46:21,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:46:21,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:46:21,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:21,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:21,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:21,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-03 14:46:21,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731352993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:21,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:21,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-03 14:46:21,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25269362] [2025-03-03 14:46:21,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:21,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:21,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:21,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:21,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:21,425 INFO L87 Difference]: Start difference. First operand 284 states and 397 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:46:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:21,460 INFO L93 Difference]: Finished difference Result 432 states and 617 transitions. [2025-03-03 14:46:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:21,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 159 [2025-03-03 14:46:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:21,463 INFO L225 Difference]: With dead ends: 432 [2025-03-03 14:46:21,463 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 14:46:21,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:21,464 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 5 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:21,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 762 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 14:46:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-03 14:46:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 224 states have (on average 1.3482142857142858) internal successors, (302), 227 states have internal predecessors, (302), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-03 14:46:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 392 transitions. [2025-03-03 14:46:21,475 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 392 transitions. Word has length 159 [2025-03-03 14:46:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:21,476 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 392 transitions. [2025-03-03 14:46:21,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:46:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 392 transitions. [2025-03-03 14:46:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 14:46:21,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:21,478 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:21,485 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-03 14:46:21,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 14:46:21,679 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:21,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1304727926, now seen corresponding path program 1 times [2025-03-03 14:46:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:21,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188436569] [2025-03-03 14:46:21,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:21,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 14:46:21,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 14:46:21,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:21,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-03 14:46:21,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:21,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188436569] [2025-03-03 14:46:21,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188436569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:21,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083299781] [2025-03-03 14:46:21,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:21,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:21,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:21,792 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:21,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:46:21,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 14:46:21,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 14:46:21,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:21,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:21,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:21,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-03 14:46:21,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:21,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083299781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:21,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:21,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:46:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046109386] [2025-03-03 14:46:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:21,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:21,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:21,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:21,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:21,947 INFO L87 Difference]: Start difference. First operand 283 states and 392 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 14:46:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:21,959 INFO L93 Difference]: Finished difference Result 430 states and 606 transitions. [2025-03-03 14:46:21,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:21,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 166 [2025-03-03 14:46:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:21,962 INFO L225 Difference]: With dead ends: 430 [2025-03-03 14:46:21,962 INFO L226 Difference]: Without dead ends: 282 [2025-03-03 14:46:21,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:21,963 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:21,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-03 14:46:21,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-03 14:46:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 224 states have (on average 1.34375) internal successors, (301), 226 states have internal predecessors, (301), 44 states have call successors, (44), 13 states have call predecessors, (44), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 14:46:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 389 transitions. [2025-03-03 14:46:21,974 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 389 transitions. Word has length 166 [2025-03-03 14:46:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:21,974 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 389 transitions. [2025-03-03 14:46:21,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 14:46:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 389 transitions. [2025-03-03 14:46:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 14:46:21,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:21,976 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:21,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:22,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:22,177 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:22,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:22,178 INFO L85 PathProgramCache]: Analyzing trace with hash -902346866, now seen corresponding path program 1 times [2025-03-03 14:46:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:22,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029722746] [2025-03-03 14:46:22,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:22,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:46:22,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:46:22,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:22,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-03 14:46:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029722746] [2025-03-03 14:46:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029722746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266367838] [2025-03-03 14:46:22,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:22,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:22,291 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:22,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:46:22,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:46:22,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:46:22,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:22,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:22,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:46:22,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-03 14:46:22,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:22,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266367838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:22,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:22,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-03 14:46:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668240998] [2025-03-03 14:46:22,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:22,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:22,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:22,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:22,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:22,488 INFO L87 Difference]: Start difference. First operand 282 states and 389 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:46:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:22,563 INFO L93 Difference]: Finished difference Result 642 states and 887 transitions. [2025-03-03 14:46:22,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:22,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 169 [2025-03-03 14:46:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:22,567 INFO L225 Difference]: With dead ends: 642 [2025-03-03 14:46:22,567 INFO L226 Difference]: Without dead ends: 495 [2025-03-03 14:46:22,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:22,568 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 318 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:22,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 725 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-03 14:46:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 489. [2025-03-03 14:46:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.359375) internal successors, (522), 386 states have internal predecessors, (522), 73 states have call successors, (73), 31 states have call predecessors, (73), 31 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-03 14:46:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 668 transitions. [2025-03-03 14:46:22,584 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 668 transitions. Word has length 169 [2025-03-03 14:46:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:22,586 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 668 transitions. [2025-03-03 14:46:22,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:46:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 668 transitions. [2025-03-03 14:46:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 14:46:22,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:22,588 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:22,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:46:22,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:22,790 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:22,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash -613988335, now seen corresponding path program 1 times [2025-03-03 14:46:22,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:22,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451121260] [2025-03-03 14:46:22,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:22,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 14:46:22,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 14:46:22,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:22,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 14:46:22,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:22,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451121260] [2025-03-03 14:46:22,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451121260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:22,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700133612] [2025-03-03 14:46:22,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:22,922 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:22,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:46:23,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 14:46:23,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 14:46:23,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:23,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:23,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:23,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 14:46:23,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:23,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700133612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:23,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:23,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-03 14:46:23,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533913280] [2025-03-03 14:46:23,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:23,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:23,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:23,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:23,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:23,111 INFO L87 Difference]: Start difference. First operand 489 states and 668 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:23,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:23,180 INFO L93 Difference]: Finished difference Result 783 states and 1088 transitions. [2025-03-03 14:46:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:23,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 200 [2025-03-03 14:46:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:23,183 INFO L225 Difference]: With dead ends: 783 [2025-03-03 14:46:23,184 INFO L226 Difference]: Without dead ends: 489 [2025-03-03 14:46:23,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:23,185 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 31 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:23,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 697 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-03 14:46:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-03 14:46:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.34375) internal successors, (516), 386 states have internal predecessors, (516), 73 states have call successors, (73), 31 states have call predecessors, (73), 31 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-03 14:46:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 662 transitions. [2025-03-03 14:46:23,203 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 662 transitions. Word has length 200 [2025-03-03 14:46:23,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:23,204 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 662 transitions. [2025-03-03 14:46:23,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 662 transitions. [2025-03-03 14:46:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-03 14:46:23,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:23,206 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:23,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 14:46:23,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:23,407 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:23,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash 108016224, now seen corresponding path program 1 times [2025-03-03 14:46:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:23,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414495863] [2025-03-03 14:46:23,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:23,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 14:46:23,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 14:46:23,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:23,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 14:46:23,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:23,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414495863] [2025-03-03 14:46:23,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414495863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:23,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277741119] [2025-03-03 14:46:23,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:23,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:23,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:23,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:23,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:46:23,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 14:46:23,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 14:46:23,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:23,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:23,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:23,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 14:46:23,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277741119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-03 14:46:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778983452] [2025-03-03 14:46:23,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:23,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:23,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:23,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:23,724 INFO L87 Difference]: Start difference. First operand 489 states and 662 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:23,782 INFO L93 Difference]: Finished difference Result 783 states and 1074 transitions. [2025-03-03 14:46:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:23,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 201 [2025-03-03 14:46:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:23,786 INFO L225 Difference]: With dead ends: 783 [2025-03-03 14:46:23,786 INFO L226 Difference]: Without dead ends: 501 [2025-03-03 14:46:23,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:23,788 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 7 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:23,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 705 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-03 14:46:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2025-03-03 14:46:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 394 states have (on average 1.3451776649746192) internal successors, (530), 396 states have internal predecessors, (530), 73 states have call successors, (73), 33 states have call predecessors, (73), 33 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-03 14:46:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 676 transitions. [2025-03-03 14:46:23,806 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 676 transitions. Word has length 201 [2025-03-03 14:46:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:23,806 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 676 transitions. [2025-03-03 14:46:23,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 676 transitions. [2025-03-03 14:46:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 14:46:23,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:23,808 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:23,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 14:46:24,008 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,SelfDestructingSolverStorable20 [2025-03-03 14:46:24,009 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:24,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:24,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1875704519, now seen corresponding path program 1 times [2025-03-03 14:46:24,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:24,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000069761] [2025-03-03 14:46:24,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:24,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:24,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 14:46:24,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 14:46:24,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:24,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 14:46:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:24,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000069761] [2025-03-03 14:46:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000069761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:24,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227863143] [2025-03-03 14:46:24,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:24,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:24,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:24,099 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:24,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:46:24,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 14:46:24,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 14:46:24,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:24,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:24,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:46:24,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-03 14:46:24,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:24,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227863143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:24,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:24,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:46:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666132506] [2025-03-03 14:46:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:24,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:24,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:24,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:24,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:24,342 INFO L87 Difference]: Start difference. First operand 501 states and 676 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:46:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:24,380 INFO L93 Difference]: Finished difference Result 1096 states and 1498 transitions. [2025-03-03 14:46:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 202 [2025-03-03 14:46:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:24,385 INFO L225 Difference]: With dead ends: 1096 [2025-03-03 14:46:24,385 INFO L226 Difference]: Without dead ends: 802 [2025-03-03 14:46:24,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:24,387 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 164 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:24,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 528 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-03-03 14:46:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 621. [2025-03-03 14:46:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 489 states have (on average 1.3456032719836402) internal successors, (658), 495 states have internal predecessors, (658), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:46:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 834 transitions. [2025-03-03 14:46:24,415 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 834 transitions. Word has length 202 [2025-03-03 14:46:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:24,415 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 834 transitions. [2025-03-03 14:46:24,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:46:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 834 transitions. [2025-03-03 14:46:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 14:46:24,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:24,418 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:24,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:24,618 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,SelfDestructingSolverStorable21 [2025-03-03 14:46:24,618 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:24,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 752615599, now seen corresponding path program 1 times [2025-03-03 14:46:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814689725] [2025-03-03 14:46:24,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:24,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 14:46:24,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 14:46:24,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:24,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 14:46:24,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:24,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814689725] [2025-03-03 14:46:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814689725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:24,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830773415] [2025-03-03 14:46:24,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:24,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:24,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:24,734 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:24,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:46:24,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 14:46:24,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 14:46:24,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:24,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:24,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:46:24,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-03 14:46:24,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:24,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830773415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:24,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:24,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:46:24,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955450706] [2025-03-03 14:46:24,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:24,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:24,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:24,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:24,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:24,956 INFO L87 Difference]: Start difference. First operand 621 states and 834 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:46:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:25,009 INFO L93 Difference]: Finished difference Result 1373 states and 1862 transitions. [2025-03-03 14:46:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:25,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 203 [2025-03-03 14:46:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:25,016 INFO L225 Difference]: With dead ends: 1373 [2025-03-03 14:46:25,016 INFO L226 Difference]: Without dead ends: 992 [2025-03-03 14:46:25,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:25,018 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 168 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:25,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 544 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2025-03-03 14:46:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 984. [2025-03-03 14:46:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 770 states have (on average 1.3545454545454545) internal successors, (1043), 784 states have internal predecessors, (1043), 142 states have call successors, (142), 71 states have call predecessors, (142), 71 states have return successors, (142), 132 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-03 14:46:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1327 transitions. [2025-03-03 14:46:25,065 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1327 transitions. Word has length 203 [2025-03-03 14:46:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:25,065 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1327 transitions. [2025-03-03 14:46:25,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:46:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1327 transitions. [2025-03-03 14:46:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 14:46:25,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:25,068 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:25,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:25,268 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,SelfDestructingSolverStorable22 [2025-03-03 14:46:25,269 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:25,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:25,269 INFO L85 PathProgramCache]: Analyzing trace with hash -520198684, now seen corresponding path program 1 times [2025-03-03 14:46:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:25,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051381316] [2025-03-03 14:46:25,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:25,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:46:25,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:46:25,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:25,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 14:46:25,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051381316] [2025-03-03 14:46:25,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051381316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057475297] [2025-03-03 14:46:25,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:25,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:25,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:25,355 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-03 14:46:25,356 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-03 14:46:25,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:46:25,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:46:25,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:25,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:25,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:46:25,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-03-03 14:46:25,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:25,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057475297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:25,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:25,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:46:25,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000829900] [2025-03-03 14:46:25,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:25,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:25,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:25,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:25,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:25,571 INFO L87 Difference]: Start difference. First operand 984 states and 1327 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:25,628 INFO L93 Difference]: Finished difference Result 2300 states and 3137 transitions. [2025-03-03 14:46:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 204 [2025-03-03 14:46:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:25,636 INFO L225 Difference]: With dead ends: 2300 [2025-03-03 14:46:25,637 INFO L226 Difference]: Without dead ends: 1596 [2025-03-03 14:46:25,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:25,639 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 175 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:25,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 561 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-03-03 14:46:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1582. [2025-03-03 14:46:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1232 states have (on average 1.3660714285714286) internal successors, (1683), 1260 states have internal predecessors, (1683), 234 states have call successors, (234), 115 states have call predecessors, (234), 115 states have return successors, (234), 214 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-03 14:46:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2151 transitions. [2025-03-03 14:46:25,705 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2151 transitions. Word has length 204 [2025-03-03 14:46:25,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:25,706 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2151 transitions. [2025-03-03 14:46:25,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2151 transitions. [2025-03-03 14:46:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 14:46:25,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:25,709 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:25,716 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-03 14:46:25,909 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,SelfDestructingSolverStorable23 [2025-03-03 14:46:25,909 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:25,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:25,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1112605315, now seen corresponding path program 1 times [2025-03-03 14:46:25,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:25,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415555037] [2025-03-03 14:46:25,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:25,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:25,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:46:25,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:46:25,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:25,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 14:46:25,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:25,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415555037] [2025-03-03 14:46:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415555037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557981920] [2025-03-03 14:46:25,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:25,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:25,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:25,996 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-03 14:46:25,997 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-03 14:46:26,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:46:26,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:46:26,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:26,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:26,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:46:26,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-03 14:46:26,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557981920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:26,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-03 14:46:26,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181067497] [2025-03-03 14:46:26,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:26,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:26,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:26,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:26,189 INFO L87 Difference]: Start difference. First operand 1582 states and 2151 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:26,247 INFO L93 Difference]: Finished difference Result 3011 states and 4105 transitions. [2025-03-03 14:46:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:26,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 204 [2025-03-03 14:46:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:26,255 INFO L225 Difference]: With dead ends: 3011 [2025-03-03 14:46:26,255 INFO L226 Difference]: Without dead ends: 1584 [2025-03-03 14:46:26,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:26,259 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:26,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1015 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-03-03 14:46:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1582. [2025-03-03 14:46:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1232 states have (on average 1.3612012987012987) internal successors, (1677), 1260 states have internal predecessors, (1677), 234 states have call successors, (234), 115 states have call predecessors, (234), 115 states have return successors, (234), 214 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-03 14:46:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2145 transitions. [2025-03-03 14:46:26,322 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2145 transitions. Word has length 204 [2025-03-03 14:46:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:26,322 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2145 transitions. [2025-03-03 14:46:26,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2145 transitions. [2025-03-03 14:46:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 14:46:26,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:26,325 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:26,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 14:46:26,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:26,526 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:26,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -319454510, now seen corresponding path program 1 times [2025-03-03 14:46:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011870289] [2025-03-03 14:46:26,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:26,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:26,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:46:26,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:46:26,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:26,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-03 14:46:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011870289] [2025-03-03 14:46:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011870289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349403386] [2025-03-03 14:46:26,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:26,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:26,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:26,627 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:26,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 14:46:26,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:46:26,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:46:26,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:26,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:26,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:26,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 127 proven. 11 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-03 14:46:26,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-03 14:46:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349403386] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:26,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:46:26,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-03-03 14:46:26,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263643877] [2025-03-03 14:46:26,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:26,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:26,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:26,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:26,926 INFO L87 Difference]: Start difference. First operand 1582 states and 2145 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:46:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:26,990 INFO L93 Difference]: Finished difference Result 3032 states and 4128 transitions. [2025-03-03 14:46:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:26,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 210 [2025-03-03 14:46:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:27,001 INFO L225 Difference]: With dead ends: 3032 [2025-03-03 14:46:27,001 INFO L226 Difference]: Without dead ends: 1573 [2025-03-03 14:46:27,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:27,006 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 34 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:27,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 477 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-03-03 14:46:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2025-03-03 14:46:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1226 states have (on average 1.3556280587275693) internal successors, (1662), 1254 states have internal predecessors, (1662), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-03 14:46:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2124 transitions. [2025-03-03 14:46:27,079 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2124 transitions. Word has length 210 [2025-03-03 14:46:27,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:27,080 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2124 transitions. [2025-03-03 14:46:27,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:46:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2124 transitions. [2025-03-03 14:46:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 14:46:27,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:27,082 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 8, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:27,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:27,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 14:46:27,284 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:27,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1105296871, now seen corresponding path program 1 times [2025-03-03 14:46:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:27,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7740698] [2025-03-03 14:46:27,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:27,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 14:46:27,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 14:46:27,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:27,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-03-03 14:46:27,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:27,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7740698] [2025-03-03 14:46:27,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7740698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:27,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035442169] [2025-03-03 14:46:27,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:27,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:27,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:27,412 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:27,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 14:46:27,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 14:46:27,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 14:46:27,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:27,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:27,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:46:27,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-03-03 14:46:27,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:27,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035442169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:27,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:27,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-03 14:46:27,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665174355] [2025-03-03 14:46:27,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:27,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:27,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:27,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:27,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:27,619 INFO L87 Difference]: Start difference. First operand 1573 states and 2124 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:27,677 INFO L93 Difference]: Finished difference Result 3040 states and 4121 transitions. [2025-03-03 14:46:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:27,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 234 [2025-03-03 14:46:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:27,686 INFO L225 Difference]: With dead ends: 3040 [2025-03-03 14:46:27,686 INFO L226 Difference]: Without dead ends: 1573 [2025-03-03 14:46:27,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:27,690 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:27,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1012 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-03-03 14:46:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2025-03-03 14:46:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1226 states have (on average 1.3531810766721044) internal successors, (1659), 1254 states have internal predecessors, (1659), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-03 14:46:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2121 transitions. [2025-03-03 14:46:27,757 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2121 transitions. Word has length 234 [2025-03-03 14:46:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:27,758 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2121 transitions. [2025-03-03 14:46:27,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2121 transitions. [2025-03-03 14:46:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-03 14:46:27,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:27,760 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:27,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 14:46:27,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 14:46:27,961 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:27,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:27,961 INFO L85 PathProgramCache]: Analyzing trace with hash 861610560, now seen corresponding path program 1 times [2025-03-03 14:46:27,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:27,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419657551] [2025-03-03 14:46:27,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:27,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:27,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 14:46:27,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 14:46:27,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:27,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 81 proven. 72 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-03 14:46:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419657551] [2025-03-03 14:46:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419657551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891985950] [2025-03-03 14:46:28,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:28,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:28,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:28,052 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:28,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 14:46:28,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 14:46:28,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 14:46:28,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:28,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:28,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:28,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 255 proven. 9 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-03-03 14:46:28,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 90 proven. 63 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-03 14:46:28,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891985950] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:28,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-03 14:46:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004839905] [2025-03-03 14:46:28,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:28,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:28,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:28,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:28,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:28,349 INFO L87 Difference]: Start difference. First operand 1573 states and 2121 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:46:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:28,418 INFO L93 Difference]: Finished difference Result 3076 states and 4162 transitions. [2025-03-03 14:46:28,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:28,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 239 [2025-03-03 14:46:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:28,426 INFO L225 Difference]: With dead ends: 3076 [2025-03-03 14:46:28,426 INFO L226 Difference]: Without dead ends: 1570 [2025-03-03 14:46:28,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:28,430 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 45 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:28,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 468 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-03 14:46:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2025-03-03 14:46:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1223 states have (on average 1.3515944399018807) internal successors, (1653), 1251 states have internal predecessors, (1653), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-03 14:46:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2115 transitions. [2025-03-03 14:46:28,490 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2115 transitions. Word has length 239 [2025-03-03 14:46:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:28,491 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2115 transitions. [2025-03-03 14:46:28,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:46:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2115 transitions. [2025-03-03 14:46:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 14:46:28,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:28,494 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:28,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:28,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 14:46:28,694 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:28,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash 359444327, now seen corresponding path program 1 times [2025-03-03 14:46:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:28,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033886143] [2025-03-03 14:46:28,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:28,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 14:46:28,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 14:46:28,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:28,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 14:46:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033886143] [2025-03-03 14:46:29,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033886143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:29,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:29,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:46:29,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748581526] [2025-03-03 14:46:29,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:29,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:29,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:29,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:29,043 INFO L87 Difference]: Start difference. First operand 1570 states and 2115 transitions. Second operand has 6 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:46:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:29,168 INFO L93 Difference]: Finished difference Result 2400 states and 3462 transitions. [2025-03-03 14:46:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:46:29,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 266 [2025-03-03 14:46:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:29,179 INFO L225 Difference]: With dead ends: 2400 [2025-03-03 14:46:29,179 INFO L226 Difference]: Without dead ends: 2398 [2025-03-03 14:46:29,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:29,181 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 116 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:29,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1779 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2025-03-03 14:46:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 1618. [2025-03-03 14:46:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1255 states have (on average 1.342629482071713) internal successors, (1685), 1291 states have internal predecessors, (1685), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-03 14:46:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2163 transitions. [2025-03-03 14:46:29,263 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2163 transitions. Word has length 266 [2025-03-03 14:46:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:29,263 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2163 transitions. [2025-03-03 14:46:29,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:46:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2163 transitions. [2025-03-03 14:46:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 14:46:29,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:29,266 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:29,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 14:46:29,266 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:29,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:29,267 INFO L85 PathProgramCache]: Analyzing trace with hash 666373643, now seen corresponding path program 1 times [2025-03-03 14:46:29,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:29,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236754090] [2025-03-03 14:46:29,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:29,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:29,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 14:46:29,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 14:46:29,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:29,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-03 14:46:29,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:29,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236754090] [2025-03-03 14:46:29,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236754090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:29,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116255925] [2025-03-03 14:46:29,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:29,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:29,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:29,583 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:29,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 14:46:29,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 14:46:29,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 14:46:29,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:29,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:29,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:46:29,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 248 proven. 37 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-03 14:46:29,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-03 14:46:30,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116255925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:30,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:30,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-03 14:46:30,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406899063] [2025-03-03 14:46:30,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:30,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 14:46:30,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:30,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 14:46:30,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:46:30,246 INFO L87 Difference]: Start difference. First operand 1618 states and 2163 transitions. Second operand has 18 states, 18 states have (on average 8.222222222222221) internal successors, (148), 14 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-03 14:46:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:30,752 INFO L93 Difference]: Finished difference Result 3973 states and 5499 transitions. [2025-03-03 14:46:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:46:30,752 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.222222222222221) internal successors, (148), 14 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 274 [2025-03-03 14:46:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:30,763 INFO L225 Difference]: With dead ends: 3973 [2025-03-03 14:46:30,764 INFO L226 Difference]: Without dead ends: 2631 [2025-03-03 14:46:30,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 539 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:46:30,769 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 219 mSDsluCounter, 4481 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 4834 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:30,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 4834 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:46:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2025-03-03 14:46:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2403. [2025-03-03 14:46:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 1857 states have (on average 1.3295638126009692) internal successors, (2469), 1909 states have internal predecessors, (2469), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2025-03-03 14:46:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 3189 transitions. [2025-03-03 14:46:30,876 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 3189 transitions. Word has length 274 [2025-03-03 14:46:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:30,877 INFO L471 AbstractCegarLoop]: Abstraction has 2403 states and 3189 transitions. [2025-03-03 14:46:30,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.222222222222221) internal successors, (148), 14 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-03 14:46:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 3189 transitions. [2025-03-03 14:46:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 14:46:30,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:30,880 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:30,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:31,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:31,082 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:31,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:31,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1627987660, now seen corresponding path program 1 times [2025-03-03 14:46:31,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:31,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451903723] [2025-03-03 14:46:31,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:31,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:31,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 14:46:31,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 14:46:31,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:31,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2025-03-03 14:46:31,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:31,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451903723] [2025-03-03 14:46:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451903723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774299125] [2025-03-03 14:46:31,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:31,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:31,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:31,175 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:31,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 14:46:31,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 14:46:31,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 14:46:31,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:31,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:31,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:31,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-03-03 14:46:31,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:31,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774299125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:31,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:31,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-03 14:46:31,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943427655] [2025-03-03 14:46:31,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:31,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:31,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:31,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:31,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:31,379 INFO L87 Difference]: Start difference. First operand 2403 states and 3189 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:46:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:31,516 INFO L93 Difference]: Finished difference Result 4642 states and 6257 transitions. [2025-03-03 14:46:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:31,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 274 [2025-03-03 14:46:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:31,527 INFO L225 Difference]: With dead ends: 4642 [2025-03-03 14:46:31,527 INFO L226 Difference]: Without dead ends: 2339 [2025-03-03 14:46:31,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:31,533 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 4 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:31,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 696 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:46:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2025-03-03 14:46:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2339. [2025-03-03 14:46:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2339 states, 1813 states have (on average 1.3121897407611693) internal successors, (2379), 1865 states have internal predecessors, (2379), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2025-03-03 14:46:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 3063 transitions. [2025-03-03 14:46:31,618 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 3063 transitions. Word has length 274 [2025-03-03 14:46:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:31,619 INFO L471 AbstractCegarLoop]: Abstraction has 2339 states and 3063 transitions. [2025-03-03 14:46:31,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:46:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 3063 transitions. [2025-03-03 14:46:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-03 14:46:31,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:31,622 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:31,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:31,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:31,823 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:31,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1411264077, now seen corresponding path program 1 times [2025-03-03 14:46:31,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:31,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807632457] [2025-03-03 14:46:31,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:31,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-03 14:46:31,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-03 14:46:31,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:31,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-03-03 14:46:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807632457] [2025-03-03 14:46:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807632457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651057894] [2025-03-03 14:46:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:31,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:31,911 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:31,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 14:46:32,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-03 14:46:32,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-03 14:46:32,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:32,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:32,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:32,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-03 14:46:32,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:32,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651057894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:32,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:32,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-03 14:46:32,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412137812] [2025-03-03 14:46:32,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:32,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:32,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:32,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:32,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:32,127 INFO L87 Difference]: Start difference. First operand 2339 states and 3063 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:46:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:32,212 INFO L93 Difference]: Finished difference Result 4425 states and 5899 transitions. [2025-03-03 14:46:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:32,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 277 [2025-03-03 14:46:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:32,226 INFO L225 Difference]: With dead ends: 4425 [2025-03-03 14:46:32,226 INFO L226 Difference]: Without dead ends: 2168 [2025-03-03 14:46:32,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:32,237 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:32,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 724 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2025-03-03 14:46:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2025-03-03 14:46:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 1672 states have (on average 1.305622009569378) internal successors, (2183), 1724 states have internal predecessors, (2183), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2025-03-03 14:46:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2829 transitions. [2025-03-03 14:46:32,324 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2829 transitions. Word has length 277 [2025-03-03 14:46:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:32,324 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 2829 transitions. [2025-03-03 14:46:32,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:46:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2829 transitions. [2025-03-03 14:46:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-03 14:46:32,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:32,326 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:32,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:32,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-03 14:46:32,527 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:32,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash -567054705, now seen corresponding path program 1 times [2025-03-03 14:46:32,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:32,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332680276] [2025-03-03 14:46:32,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:32,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:32,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 14:46:32,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 14:46:32,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:32,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 24 proven. 141 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-03 14:46:33,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:33,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332680276] [2025-03-03 14:46:33,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332680276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:33,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858098027] [2025-03-03 14:46:33,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:33,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:33,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:33,753 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:33,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 14:46:33,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 14:46:33,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 14:46:33,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:33,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:33,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:46:33,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 14:46:34,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858098027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:34,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2025-03-03 14:46:34,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108174873] [2025-03-03 14:46:34,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:34,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:46:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:34,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:46:34,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:46:34,100 INFO L87 Difference]: Start difference. First operand 2168 states and 2829 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:46:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:34,416 INFO L93 Difference]: Finished difference Result 4798 states and 6268 transitions. [2025-03-03 14:46:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:46:34,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 289 [2025-03-03 14:46:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:34,429 INFO L225 Difference]: With dead ends: 4798 [2025-03-03 14:46:34,430 INFO L226 Difference]: Without dead ends: 3192 [2025-03-03 14:46:34,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:46:34,434 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 128 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:34,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1879 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:46:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2025-03-03 14:46:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3178. [2025-03-03 14:46:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3178 states, 2443 states have (on average 1.2988129349160868) internal successors, (3173), 2523 states have internal predecessors, (3173), 467 states have call successors, (467), 267 states have call predecessors, (467), 267 states have return successors, (467), 395 states have call predecessors, (467), 467 states have call successors, (467) [2025-03-03 14:46:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4107 transitions. [2025-03-03 14:46:34,553 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4107 transitions. Word has length 289 [2025-03-03 14:46:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:34,554 INFO L471 AbstractCegarLoop]: Abstraction has 3178 states and 4107 transitions. [2025-03-03 14:46:34,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:46:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4107 transitions. [2025-03-03 14:46:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 14:46:34,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:34,557 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:34,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-03 14:46:34,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-03 14:46:34,757 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:34,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:34,758 INFO L85 PathProgramCache]: Analyzing trace with hash -586162388, now seen corresponding path program 1 times [2025-03-03 14:46:34,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:34,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500809997] [2025-03-03 14:46:34,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:34,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:34,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 14:46:34,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 14:46:34,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:34,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-03-03 14:46:34,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500809997] [2025-03-03 14:46:34,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500809997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:34,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:34,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:46:34,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894055120] [2025-03-03 14:46:34,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:34,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:34,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:34,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:34,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:34,896 INFO L87 Difference]: Start difference. First operand 3178 states and 4107 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:46:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:35,025 INFO L93 Difference]: Finished difference Result 6178 states and 8173 transitions. [2025-03-03 14:46:35,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:46:35,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 295 [2025-03-03 14:46:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:35,038 INFO L225 Difference]: With dead ends: 6178 [2025-03-03 14:46:35,038 INFO L226 Difference]: Without dead ends: 3502 [2025-03-03 14:46:35,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:35,044 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 38 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:35,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 781 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2025-03-03 14:46:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3434. [2025-03-03 14:46:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 2651 states have (on average 1.3115805356469257) internal successors, (3477), 2731 states have internal predecessors, (3477), 515 states have call successors, (515), 267 states have call predecessors, (515), 267 states have return successors, (515), 443 states have call predecessors, (515), 515 states have call successors, (515) [2025-03-03 14:46:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4507 transitions. [2025-03-03 14:46:35,171 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4507 transitions. Word has length 295 [2025-03-03 14:46:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:35,171 INFO L471 AbstractCegarLoop]: Abstraction has 3434 states and 4507 transitions. [2025-03-03 14:46:35,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:46:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4507 transitions. [2025-03-03 14:46:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 14:46:35,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:35,174 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:35,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 14:46:35,175 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:35,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash 646113770, now seen corresponding path program 1 times [2025-03-03 14:46:35,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:35,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490906412] [2025-03-03 14:46:35,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:35,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 14:46:35,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 14:46:35,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:35,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-03-03 14:46:35,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:35,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490906412] [2025-03-03 14:46:35,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490906412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:35,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924816915] [2025-03-03 14:46:35,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:35,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:35,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:35,428 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:35,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 14:46:35,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 14:46:35,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 14:46:35,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:35,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:35,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:46:35,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 14:46:35,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:35,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924816915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:35,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:35,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 11 [2025-03-03 14:46:35,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402589882] [2025-03-03 14:46:35,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:35,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:46:35,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:35,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:46:35,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:46:35,781 INFO L87 Difference]: Start difference. First operand 3434 states and 4507 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 9 states have internal predecessors, (115), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:46:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:36,431 INFO L93 Difference]: Finished difference Result 7948 states and 10416 transitions. [2025-03-03 14:46:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:46:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 9 states have internal predecessors, (115), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 295 [2025-03-03 14:46:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:36,455 INFO L225 Difference]: With dead ends: 7948 [2025-03-03 14:46:36,455 INFO L226 Difference]: Without dead ends: 5020 [2025-03-03 14:46:36,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:46:36,463 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 604 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:36,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 2355 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:46:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2025-03-03 14:46:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4272. [2025-03-03 14:46:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4272 states, 3293 states have (on average 1.305192833282721) internal successors, (4298), 3389 states have internal predecessors, (4298), 643 states have call successors, (643), 335 states have call predecessors, (643), 335 states have return successors, (643), 555 states have call predecessors, (643), 643 states have call successors, (643) [2025-03-03 14:46:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 5584 transitions. [2025-03-03 14:46:36,656 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 5584 transitions. Word has length 295 [2025-03-03 14:46:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:36,657 INFO L471 AbstractCegarLoop]: Abstraction has 4272 states and 5584 transitions. [2025-03-03 14:46:36,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 9 states have internal predecessors, (115), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:46:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 5584 transitions. [2025-03-03 14:46:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 14:46:36,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:36,659 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:36,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-03 14:46:36,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:36,860 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:36,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:36,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1089641194, now seen corresponding path program 1 times [2025-03-03 14:46:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:36,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553844834] [2025-03-03 14:46:36,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:36,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:36,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 14:46:36,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 14:46:36,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:36,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-03-03 14:46:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:37,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553844834] [2025-03-03 14:46:37,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553844834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:37,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251477606] [2025-03-03 14:46:37,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:37,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:37,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:37,033 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:37,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 14:46:37,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 14:46:37,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 14:46:37,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:37,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:37,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:46:37,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-03-03 14:46:37,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:37,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251477606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:37,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:37,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2025-03-03 14:46:37,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319067140] [2025-03-03 14:46:37,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:37,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:46:37,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:37,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:46:37,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:46:37,278 INFO L87 Difference]: Start difference. First operand 4272 states and 5584 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:46:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:37,642 INFO L93 Difference]: Finished difference Result 8164 states and 10673 transitions. [2025-03-03 14:46:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:46:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 295 [2025-03-03 14:46:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:37,658 INFO L225 Difference]: With dead ends: 8164 [2025-03-03 14:46:37,659 INFO L226 Difference]: Without dead ends: 4386 [2025-03-03 14:46:37,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:46:37,665 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 121 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:37,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1736 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:46:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2025-03-03 14:46:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 4144. [2025-03-03 14:46:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 3197 states have (on average 1.2980919612136377) internal successors, (4150), 3289 states have internal predecessors, (4150), 615 states have call successors, (615), 331 states have call predecessors, (615), 331 states have return successors, (615), 531 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-03 14:46:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5380 transitions. [2025-03-03 14:46:37,813 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5380 transitions. Word has length 295 [2025-03-03 14:46:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:37,813 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5380 transitions. [2025-03-03 14:46:37,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:46:37,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5380 transitions. [2025-03-03 14:46:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-03 14:46:37,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:37,816 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:37,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:38,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:38,017 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:38,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash 989395654, now seen corresponding path program 1 times [2025-03-03 14:46:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326424067] [2025-03-03 14:46:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:38,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 14:46:38,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 14:46:38,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:38,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2025-03-03 14:46:38,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:38,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326424067] [2025-03-03 14:46:38,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326424067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:38,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:38,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:38,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771081599] [2025-03-03 14:46:38,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:38,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:38,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:38,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:38,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:38,104 INFO L87 Difference]: Start difference. First operand 4144 states and 5380 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 14:46:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:38,389 INFO L93 Difference]: Finished difference Result 6100 states and 7966 transitions. [2025-03-03 14:46:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:38,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 302 [2025-03-03 14:46:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:38,403 INFO L225 Difference]: With dead ends: 6100 [2025-03-03 14:46:38,403 INFO L226 Difference]: Without dead ends: 2742 [2025-03-03 14:46:38,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:38,409 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 441 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:38,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 886 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:46:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2025-03-03 14:46:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2714. [2025-03-03 14:46:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2106 states have (on average 1.2763532763532763) internal successors, (2688), 2162 states have internal predecessors, (2688), 399 states have call successors, (399), 208 states have call predecessors, (399), 208 states have return successors, (399), 343 states have call predecessors, (399), 399 states have call successors, (399) [2025-03-03 14:46:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3486 transitions. [2025-03-03 14:46:38,510 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3486 transitions. Word has length 302 [2025-03-03 14:46:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:38,511 INFO L471 AbstractCegarLoop]: Abstraction has 2714 states and 3486 transitions. [2025-03-03 14:46:38,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 14:46:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3486 transitions. [2025-03-03 14:46:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-03 14:46:38,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:38,516 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:38,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 14:46:38,516 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:38,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:38,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1978073361, now seen corresponding path program 1 times [2025-03-03 14:46:38,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:38,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700497695] [2025-03-03 14:46:38,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:38,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:38,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-03 14:46:38,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-03 14:46:38,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:38,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 33 proven. 71 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-03-03 14:46:39,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700497695] [2025-03-03 14:46:39,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700497695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452028407] [2025-03-03 14:46:39,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:39,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:39,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:39,516 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:39,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 14:46:39,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-03 14:46:39,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-03 14:46:39,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:39,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:39,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1305 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 14:46:39,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 198 proven. 108 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-03 14:46:40,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 33 proven. 71 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-03-03 14:46:40,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452028407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:40,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:40,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 16] total 38 [2025-03-03 14:46:40,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423994836] [2025-03-03 14:46:40,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:40,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 14:46:40,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:40,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 14:46:40,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 14:46:40,743 INFO L87 Difference]: Start difference. First operand 2714 states and 3486 transitions. Second operand has 38 states, 36 states have (on average 6.777777777777778) internal successors, (244), 32 states have internal predecessors, (244), 9 states have call successors, (48), 8 states have call predecessors, (48), 18 states have return successors, (52), 12 states have call predecessors, (52), 8 states have call successors, (52) [2025-03-03 14:46:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:45,321 INFO L93 Difference]: Finished difference Result 11572 states and 15641 transitions. [2025-03-03 14:46:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-03 14:46:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 6.777777777777778) internal successors, (244), 32 states have internal predecessors, (244), 9 states have call successors, (48), 8 states have call predecessors, (48), 18 states have return successors, (52), 12 states have call predecessors, (52), 8 states have call successors, (52) Word has length 345 [2025-03-03 14:46:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:45,356 INFO L225 Difference]: With dead ends: 11572 [2025-03-03 14:46:45,356 INFO L226 Difference]: Without dead ends: 9644 [2025-03-03 14:46:45,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 679 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1543, Invalid=8357, Unknown=0, NotChecked=0, Total=9900 [2025-03-03 14:46:45,366 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1746 mSDsluCounter, 9299 mSDsCounter, 0 mSdLazyCounter, 6284 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 9923 SdHoareTripleChecker+Invalid, 6971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 6284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:45,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 9923 Invalid, 6971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 6284 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 14:46:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2025-03-03 14:46:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 7124. [2025-03-03 14:46:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7124 states, 5472 states have (on average 1.287828947368421) internal successors, (7047), 5576 states have internal predecessors, (7047), 1111 states have call successors, (1111), 516 states have call predecessors, (1111), 540 states have return successors, (1159), 1031 states have call predecessors, (1159), 1111 states have call successors, (1159) [2025-03-03 14:46:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7124 states to 7124 states and 9317 transitions. [2025-03-03 14:46:45,826 INFO L78 Accepts]: Start accepts. Automaton has 7124 states and 9317 transitions. Word has length 345 [2025-03-03 14:46:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:45,826 INFO L471 AbstractCegarLoop]: Abstraction has 7124 states and 9317 transitions. [2025-03-03 14:46:45,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 6.777777777777778) internal successors, (244), 32 states have internal predecessors, (244), 9 states have call successors, (48), 8 states have call predecessors, (48), 18 states have return successors, (52), 12 states have call predecessors, (52), 8 states have call successors, (52) [2025-03-03 14:46:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7124 states and 9317 transitions. [2025-03-03 14:46:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-03 14:46:45,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:45,838 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:45,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:46,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-03 14:46:46,042 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:46,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2120380430, now seen corresponding path program 1 times [2025-03-03 14:46:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:46,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359618160] [2025-03-03 14:46:46,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:46,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:46,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-03 14:46:46,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-03 14:46:46,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:46,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2025-03-03 14:46:46,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:46,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359618160] [2025-03-03 14:46:46,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359618160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:46,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5402765] [2025-03-03 14:46:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:46,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:46,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:46,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:46,145 INFO L87 Difference]: Start difference. First operand 7124 states and 9317 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 14:46:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:46,636 INFO L93 Difference]: Finished difference Result 14481 states and 18973 transitions. [2025-03-03 14:46:46,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:46,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 345 [2025-03-03 14:46:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:46,663 INFO L225 Difference]: With dead ends: 14481 [2025-03-03 14:46:46,663 INFO L226 Difference]: Without dead ends: 7028 [2025-03-03 14:46:46,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:46,677 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 26 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:46,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 670 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2025-03-03 14:46:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 7028. [2025-03-03 14:46:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7028 states, 5400 states have (on average 1.2555555555555555) internal successors, (6780), 5504 states have internal predecessors, (6780), 1111 states have call successors, (1111), 516 states have call predecessors, (1111), 516 states have return successors, (1111), 1007 states have call predecessors, (1111), 1111 states have call successors, (1111) [2025-03-03 14:46:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7028 states to 7028 states and 9002 transitions. [2025-03-03 14:46:47,069 INFO L78 Accepts]: Start accepts. Automaton has 7028 states and 9002 transitions. Word has length 345 [2025-03-03 14:46:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:47,069 INFO L471 AbstractCegarLoop]: Abstraction has 7028 states and 9002 transitions. [2025-03-03 14:46:47,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 14:46:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7028 states and 9002 transitions. [2025-03-03 14:46:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-03 14:46:47,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:47,080 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:47,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 14:46:47,080 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:47,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash -416601984, now seen corresponding path program 1 times [2025-03-03 14:46:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:47,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162065508] [2025-03-03 14:46:47,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:47,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-03 14:46:47,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-03 14:46:47,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:47,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2025-03-03 14:46:47,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:47,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162065508] [2025-03-03 14:46:47,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162065508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:47,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903802442] [2025-03-03 14:46:47,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:47,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:47,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:47,850 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:47,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-03 14:46:47,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-03 14:46:48,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-03 14:46:48,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:48,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:48,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:46:48,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 161 proven. 32 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-03-03 14:46:48,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2025-03-03 14:46:48,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903802442] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:48,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:46:48,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [22, 7] total 32 [2025-03-03 14:46:48,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113258629] [2025-03-03 14:46:48,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:48,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:46:48,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:48,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:46:48,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=922, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:46:48,423 INFO L87 Difference]: Start difference. First operand 7028 states and 9002 transitions. Second operand has 9 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:46:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:49,000 INFO L93 Difference]: Finished difference Result 15487 states and 20926 transitions. [2025-03-03 14:46:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:46:49,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 350 [2025-03-03 14:46:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:49,048 INFO L225 Difference]: With dead ends: 15487 [2025-03-03 14:46:49,048 INFO L226 Difference]: Without dead ends: 9345 [2025-03-03 14:46:49,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:46:49,062 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 113 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:49,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 2542 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:46:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9345 states. [2025-03-03 14:46:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9345 to 6279. [2025-03-03 14:46:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6279 states, 4824 states have (on average 1.2529021558872304) internal successors, (6044), 4918 states have internal predecessors, (6044), 992 states have call successors, (992), 462 states have call predecessors, (992), 462 states have return successors, (992), 898 states have call predecessors, (992), 992 states have call successors, (992) [2025-03-03 14:46:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6279 states to 6279 states and 8028 transitions. [2025-03-03 14:46:49,503 INFO L78 Accepts]: Start accepts. Automaton has 6279 states and 8028 transitions. Word has length 350 [2025-03-03 14:46:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:49,503 INFO L471 AbstractCegarLoop]: Abstraction has 6279 states and 8028 transitions. [2025-03-03 14:46:49,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:46:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 6279 states and 8028 transitions. [2025-03-03 14:46:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-03 14:46:49,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:49,513 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:49,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:49,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-03 14:46:49,717 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:49,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1287637947, now seen corresponding path program 1 times [2025-03-03 14:46:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:49,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195065558] [2025-03-03 14:46:49,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:49,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:49,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-03 14:46:49,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-03 14:46:49,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:49,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2025-03-03 14:46:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195065558] [2025-03-03 14:46:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195065558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:50,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:50,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:46:50,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291898870] [2025-03-03 14:46:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:50,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:46:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:50,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:46:50,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:50,381 INFO L87 Difference]: Start difference. First operand 6279 states and 8028 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 14:46:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:51,128 INFO L93 Difference]: Finished difference Result 14261 states and 17981 transitions. [2025-03-03 14:46:51,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:46:51,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 355 [2025-03-03 14:46:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:51,156 INFO L225 Difference]: With dead ends: 14261 [2025-03-03 14:46:51,156 INFO L226 Difference]: Without dead ends: 9123 [2025-03-03 14:46:51,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:46:51,165 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 69 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:51,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1715 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:46:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9123 states. [2025-03-03 14:46:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9123 to 7518. [2025-03-03 14:46:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7518 states, 5762 states have (on average 1.2335994446372787) internal successors, (7108), 5884 states have internal predecessors, (7108), 1174 states have call successors, (1174), 581 states have call predecessors, (1174), 581 states have return successors, (1174), 1052 states have call predecessors, (1174), 1174 states have call successors, (1174) [2025-03-03 14:46:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7518 states to 7518 states and 9456 transitions. [2025-03-03 14:46:51,609 INFO L78 Accepts]: Start accepts. Automaton has 7518 states and 9456 transitions. Word has length 355 [2025-03-03 14:46:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:51,610 INFO L471 AbstractCegarLoop]: Abstraction has 7518 states and 9456 transitions. [2025-03-03 14:46:51,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 14:46:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 7518 states and 9456 transitions. [2025-03-03 14:46:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-03 14:46:51,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:51,620 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:46:51,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 14:46:51,620 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1866457044, now seen corresponding path program 1 times [2025-03-03 14:46:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:51,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672774124] [2025-03-03 14:46:51,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:51,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-03 14:46:51,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-03 14:46:51,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:51,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 22 proven. 28 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-03 14:46:52,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:52,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672774124] [2025-03-03 14:46:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672774124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:52,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981616286] [2025-03-03 14:46:52,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:52,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:52,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:52,286 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:52,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-03 14:46:52,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-03 14:46:52,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-03 14:46:52,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:52,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:52,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 14:46:52,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 260 proven. 126 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-03-03 14:46:53,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 14:46:53,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981616286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:53,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:53,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 18] total 43 [2025-03-03 14:46:53,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963158874] [2025-03-03 14:46:53,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:53,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 14:46:53,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:53,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 14:46:53,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:46:53,850 INFO L87 Difference]: Start difference. First operand 7518 states and 9456 transitions. Second operand has 43 states, 42 states have (on average 7.190476190476191) internal successors, (302), 39 states have internal predecessors, (302), 19 states have call successors, (71), 8 states have call predecessors, (71), 10 states have return successors, (70), 21 states have call predecessors, (70), 18 states have call successors, (70) [2025-03-03 14:47:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:20,637 INFO L93 Difference]: Finished difference Result 91665 states and 125674 transitions. [2025-03-03 14:47:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 457 states. [2025-03-03 14:47:20,638 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 7.190476190476191) internal successors, (302), 39 states have internal predecessors, (302), 19 states have call successors, (71), 8 states have call predecessors, (71), 10 states have return successors, (70), 21 states have call predecessors, (70), 18 states have call successors, (70) Word has length 365 [2025-03-03 14:47:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:20,906 INFO L225 Difference]: With dead ends: 91665 [2025-03-03 14:47:20,906 INFO L226 Difference]: Without dead ends: 85414 [2025-03-03 14:47:20,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1265 GetRequests, 769 SyntacticMatches, 0 SemanticMatches, 496 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107561 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=12442, Invalid=235064, Unknown=0, NotChecked=0, Total=247506 [2025-03-03 14:47:20,961 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 7907 mSDsluCounter, 38276 mSDsCounter, 0 mSdLazyCounter, 24146 mSolverCounterSat, 2811 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7907 SdHoareTripleChecker+Valid, 39757 SdHoareTripleChecker+Invalid, 26957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2811 IncrementalHoareTripleChecker+Valid, 24146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:20,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7907 Valid, 39757 Invalid, 26957 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2811 Valid, 24146 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2025-03-03 14:47:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85414 states. [2025-03-03 14:47:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85414 to 25798. [2025-03-03 14:47:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25798 states, 19622 states have (on average 1.2327489552543065) internal successors, (24189), 20206 states have internal predecessors, (24189), 4126 states have call successors, (4126), 2049 states have call predecessors, (4126), 2049 states have return successors, (4126), 3542 states have call predecessors, (4126), 4126 states have call successors, (4126) [2025-03-03 14:47:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25798 states to 25798 states and 32441 transitions. [2025-03-03 14:47:24,344 INFO L78 Accepts]: Start accepts. Automaton has 25798 states and 32441 transitions. Word has length 365 [2025-03-03 14:47:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:24,344 INFO L471 AbstractCegarLoop]: Abstraction has 25798 states and 32441 transitions. [2025-03-03 14:47:24,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 7.190476190476191) internal successors, (302), 39 states have internal predecessors, (302), 19 states have call successors, (71), 8 states have call predecessors, (71), 10 states have return successors, (70), 21 states have call predecessors, (70), 18 states have call successors, (70) [2025-03-03 14:47:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 25798 states and 32441 transitions. [2025-03-03 14:47:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-03 14:47:24,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:24,378 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:47:24,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-03 14:47:24,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-03 14:47:24,579 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:24,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash -618876773, now seen corresponding path program 1 times [2025-03-03 14:47:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:24,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791460284] [2025-03-03 14:47:24,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:24,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-03 14:47:24,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-03 14:47:24,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:24,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 14:47:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791460284] [2025-03-03 14:47:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791460284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:47:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823615913] [2025-03-03 14:47:25,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:25,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:47:25,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:47:25,671 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:47:25,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-03 14:47:25,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-03 14:47:25,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-03 14:47:25,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:25,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:25,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 14:47:25,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:47:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 264 proven. 120 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-03 14:47:26,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:47:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 14:47:27,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823615913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:47:27,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:47:27,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 18] total 40 [2025-03-03 14:47:27,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093527113] [2025-03-03 14:47:27,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:47:27,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 14:47:27,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:27,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 14:47:27,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1396, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:47:27,129 INFO L87 Difference]: Start difference. First operand 25798 states and 32441 transitions. Second operand has 40 states, 39 states have (on average 8.384615384615385) internal successors, (327), 37 states have internal predecessors, (327), 21 states have call successors, (76), 8 states have call predecessors, (76), 10 states have return successors, (75), 22 states have call predecessors, (75), 20 states have call successors, (75)