./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.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 35b23af90f01e46e9f818578c532dc01a817e343291a24c8592db5f0da05a3c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:05:04,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:05:05,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:05:05,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:05:05,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:05:05,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:05:05,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:05:05,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:05:05,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:05:05,081 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:05:05,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:05:05,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:05:05,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:05:05,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:05:05,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:05:05,083 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:05:05,083 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:05:05,083 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:05:05,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:05:05,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:05:05,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:05:05,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:05:05,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:05:05,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:05:05,083 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:05:05,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:05:05,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:05:05,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:05:05,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:05:05,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:05:05,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:05:05,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:05:05,084 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 -> 35b23af90f01e46e9f818578c532dc01a817e343291a24c8592db5f0da05a3c7 [2025-03-16 19:05:05,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:05:05,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:05:05,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:05:05,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:05:05,314 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:05:05,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2025-03-16 19:05:06,463 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce306728/f1bd4493e75d456a8113116232e1a30d/FLAGce7653093 [2025-03-16 19:05:06,723 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:05:06,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2025-03-16 19:05:06,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce306728/f1bd4493e75d456a8113116232e1a30d/FLAGce7653093 [2025-03-16 19:05:06,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce306728/f1bd4493e75d456a8113116232e1a30d [2025-03-16 19:05:06,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:05:06,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:05:06,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:05:06,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:05:06,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:05:06,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:06,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb45b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06, skipping insertion in model container [2025-03-16 19:05:06,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:06,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:05:06,922 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.ufo.BOUNDED-10.pals.c[12042,12055] [2025-03-16 19:05:06,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:05:06,930 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:05:06,969 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.ufo.BOUNDED-10.pals.c[12042,12055] [2025-03-16 19:05:06,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:05:06,983 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:05:06,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06 WrapperNode [2025-03-16 19:05:06,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:05:06,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:05:06,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:05:06,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:05:06,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:06,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,016 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 426 [2025-03-16 19:05:07,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:05:07,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:05:07,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:05:07,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:05:07,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,050 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-16 19:05:07,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:05:07,065 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:05:07,066 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:05:07,066 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:05:07,066 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (1/1) ... [2025-03-16 19:05:07,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:05:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:07,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:05:07,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:05:07,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:05:07,124 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-03-16 19:05:07,124 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-03-16 19:05:07,125 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-16 19:05:07,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-16 19:05:07,125 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-03-16 19:05:07,125 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-03-16 19:05:07,126 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-03-16 19:05:07,126 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-03-16 19:05:07,126 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-03-16 19:05:07,126 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-03-16 19:05:07,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:05:07,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:05:07,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:05:07,222 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:05:07,223 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:05:07,725 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-16 19:05:07,726 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:05:07,741 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:05:07,743 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:05:07,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:05:07 BoogieIcfgContainer [2025-03-16 19:05:07,743 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:05:07,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:05:07,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:05:07,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:05:07,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:05:06" (1/3) ... [2025-03-16 19:05:07,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afeae36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:05:07, skipping insertion in model container [2025-03-16 19:05:07,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:06" (2/3) ... [2025-03-16 19:05:07,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afeae36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:05:07, skipping insertion in model container [2025-03-16 19:05:07,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:05:07" (3/3) ... [2025-03-16 19:05:07,752 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2025-03-16 19:05:07,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:05:07,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c that has 6 procedures, 171 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 19:05:07,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:05:07,826 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;@76de37d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:05:07,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:05:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 132 states have (on average 1.6136363636363635) internal successors, (213), 136 states have internal predecessors, (213), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-16 19:05:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 19:05:07,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:07,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:07,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:07,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1244172973, now seen corresponding path program 1 times [2025-03-16 19:05:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:07,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684747209] [2025-03-16 19:05:07,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:07,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 19:05:07,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 19:05:07,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:07,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:08,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:08,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684747209] [2025-03-16 19:05:08,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684747209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:08,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:08,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549719358] [2025-03-16 19:05:08,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:08,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:08,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:08,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:08,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:08,162 INFO L87 Difference]: Start difference. First operand has 171 states, 132 states have (on average 1.6136363636363635) internal successors, (213), 136 states have internal predecessors, (213), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-16 19:05:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:08,275 INFO L93 Difference]: Finished difference Result 346 states and 591 transitions. [2025-03-16 19:05:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:08,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 14 [2025-03-16 19:05:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:08,282 INFO L225 Difference]: With dead ends: 346 [2025-03-16 19:05:08,282 INFO L226 Difference]: Without dead ends: 175 [2025-03-16 19:05:08,286 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-16 19:05:08,288 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 7 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 785 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-16 19:05:08,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 785 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-16 19:05:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-16 19:05:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.5588235294117647) internal successors, (212), 139 states have internal predecessors, (212), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-16 19:05:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 276 transitions. [2025-03-16 19:05:08,337 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 276 transitions. Word has length 14 [2025-03-16 19:05:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:08,338 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 276 transitions. [2025-03-16 19:05:08,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-16 19:05:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 276 transitions. [2025-03-16 19:05:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 19:05:08,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:08,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:08,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:05:08,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:08,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:08,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1217906051, now seen corresponding path program 1 times [2025-03-16 19:05:08,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:08,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802905992] [2025-03-16 19:05:08,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:08,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:08,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 19:05:08,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 19:05:08,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:08,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:08,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802905992] [2025-03-16 19:05:08,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802905992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:08,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:08,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:08,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544734760] [2025-03-16 19:05:08,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:08,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:08,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:08,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:08,429 INFO L87 Difference]: Start difference. First operand 175 states and 276 transitions. 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), 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-16 19:05:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:08,489 INFO L93 Difference]: Finished difference Result 362 states and 574 transitions. [2025-03-16 19:05:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:08,491 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), 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 15 [2025-03-16 19:05:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:08,493 INFO L225 Difference]: With dead ends: 362 [2025-03-16 19:05:08,494 INFO L226 Difference]: Without dead ends: 189 [2025-03-16 19:05:08,495 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-16 19:05:08,496 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 22 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 797 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-16 19:05:08,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 797 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-16 19:05:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-03-16 19:05:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 149 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-16 19:05:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 291 transitions. [2025-03-16 19:05:08,516 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 291 transitions. Word has length 15 [2025-03-16 19:05:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:08,516 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 291 transitions. [2025-03-16 19:05:08,517 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), 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-16 19:05:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 291 transitions. [2025-03-16 19:05:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 19:05:08,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:08,518 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] [2025-03-16 19:05:08,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:05:08,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:08,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash -661101358, now seen corresponding path program 1 times [2025-03-16 19:05:08,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:08,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884140080] [2025-03-16 19:05:08,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:08,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:08,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 19:05:08,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 19:05:08,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:08,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884140080] [2025-03-16 19:05:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884140080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:08,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:08,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:08,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050414133] [2025-03-16 19:05:08,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:08,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:08,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:08,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:08,606 INFO L87 Difference]: Start difference. First operand 187 states and 291 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 19:05:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:08,627 INFO L93 Difference]: Finished difference Result 394 states and 620 transitions. [2025-03-16 19:05:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:08,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-16 19:05:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:08,630 INFO L225 Difference]: With dead ends: 394 [2025-03-16 19:05:08,631 INFO L226 Difference]: Without dead ends: 216 [2025-03-16 19:05:08,632 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-16 19:05:08,632 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 22 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 534 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-16 19:05:08,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 534 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-16 19:05:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2025-03-16 19:05:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 151 states have internal predecessors, (227), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-16 19:05:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 293 transitions. [2025-03-16 19:05:08,647 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 293 transitions. Word has length 21 [2025-03-16 19:05:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:08,648 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 293 transitions. [2025-03-16 19:05:08,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 19:05:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 293 transitions. [2025-03-16 19:05:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 19:05:08,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:08,649 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] [2025-03-16 19:05:08,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:05:08,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:08,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:08,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1461264352, now seen corresponding path program 1 times [2025-03-16 19:05:08,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:08,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424396448] [2025-03-16 19:05:08,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:08,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:08,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 19:05:08,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 19:05:08,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:08,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:08,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424396448] [2025-03-16 19:05:08,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424396448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:08,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:08,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:08,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378680234] [2025-03-16 19:05:08,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:08,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:08,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:08,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:08,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:08,754 INFO L87 Difference]: Start difference. First operand 189 states and 293 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 19:05:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:08,793 INFO L93 Difference]: Finished difference Result 427 states and 678 transitions. [2025-03-16 19:05:08,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:08,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-16 19:05:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:08,797 INFO L225 Difference]: With dead ends: 427 [2025-03-16 19:05:08,797 INFO L226 Difference]: Without dead ends: 286 [2025-03-16 19:05:08,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:08,798 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 120 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:08,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 789 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-16 19:05:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 189. [2025-03-16 19:05:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.5067567567567568) internal successors, (223), 151 states have internal predecessors, (223), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-16 19:05:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 289 transitions. [2025-03-16 19:05:08,813 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 289 transitions. Word has length 30 [2025-03-16 19:05:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:08,813 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 289 transitions. [2025-03-16 19:05:08,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 19:05:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 289 transitions. [2025-03-16 19:05:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 19:05:08,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:08,816 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:05:08,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:05:08,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:08,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash 504343241, now seen corresponding path program 1 times [2025-03-16 19:05:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:08,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724161220] [2025-03-16 19:05:08,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:08,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 19:05:08,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 19:05:08,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:08,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:08,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:08,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724161220] [2025-03-16 19:05:08,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724161220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:08,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:08,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:08,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475482434] [2025-03-16 19:05:08,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:08,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:08,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:08,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:08,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:08,891 INFO L87 Difference]: Start difference. First operand 189 states and 289 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-16 19:05:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:08,923 INFO L93 Difference]: Finished difference Result 370 states and 569 transitions. [2025-03-16 19:05:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:08,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 31 [2025-03-16 19:05:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:08,933 INFO L225 Difference]: With dead ends: 370 [2025-03-16 19:05:08,933 INFO L226 Difference]: Without dead ends: 191 [2025-03-16 19:05:08,934 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-16 19:05:08,934 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1050 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-16 19:05:08,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1050 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-16 19:05:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2025-03-16 19:05:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.5) internal successors, (222), 151 states have internal predecessors, (222), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-16 19:05:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 288 transitions. [2025-03-16 19:05:08,951 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 288 transitions. Word has length 31 [2025-03-16 19:05:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:08,951 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 288 transitions. [2025-03-16 19:05:08,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-16 19:05:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 288 transitions. [2025-03-16 19:05:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 19:05:08,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:08,952 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:05:08,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:05:08,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:08,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:08,953 INFO L85 PathProgramCache]: Analyzing trace with hash 820713225, now seen corresponding path program 1 times [2025-03-16 19:05:08,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:08,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294263044] [2025-03-16 19:05:08,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:08,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:08,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:05:08,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:05:08,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:08,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:09,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:09,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294263044] [2025-03-16 19:05:09,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294263044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:09,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082920879] [2025-03-16 19:05:09,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:09,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:09,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:09,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:05:09,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:05:09,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:05:09,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:05:09,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:09,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:09,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:05:09,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:09,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:09,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082920879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:09,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:09,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:05:09,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879275539] [2025-03-16 19:05:09,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:09,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:05:09,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:09,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:05:09,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:09,184 INFO L87 Difference]: Start difference. First operand 189 states and 288 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-16 19:05:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:09,227 INFO L93 Difference]: Finished difference Result 427 states and 664 transitions. [2025-03-16 19:05:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:09,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 33 [2025-03-16 19:05:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:09,230 INFO L225 Difference]: With dead ends: 427 [2025-03-16 19:05:09,230 INFO L226 Difference]: Without dead ends: 248 [2025-03-16 19:05:09,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-16 19:05:09,231 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 73 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:09,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 810 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-16 19:05:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2025-03-16 19:05:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 191 states have (on average 1.4712041884816753) internal successors, (281), 194 states have internal predecessors, (281), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-16 19:05:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 367 transitions. [2025-03-16 19:05:09,246 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 367 transitions. Word has length 33 [2025-03-16 19:05:09,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:09,246 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 367 transitions. [2025-03-16 19:05:09,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-16 19:05:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 367 transitions. [2025-03-16 19:05:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:05:09,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:09,249 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] [2025-03-16 19:05:09,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:05:09,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 19:05:09,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:09,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash -144471479, now seen corresponding path program 2 times [2025-03-16 19:05:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:09,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367344230] [2025-03-16 19:05:09,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:05:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:09,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-16 19:05:09,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 55 statements. [2025-03-16 19:05:09,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:05:09,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:09,496 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-16 19:05:09,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:09,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367344230] [2025-03-16 19:05:09,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367344230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:09,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:09,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023232137] [2025-03-16 19:05:09,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:09,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:09,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:09,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:09,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:09,498 INFO L87 Difference]: Start difference. First operand 242 states and 367 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-16 19:05:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:09,538 INFO L93 Difference]: Finished difference Result 464 states and 720 transitions. [2025-03-16 19:05:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 55 [2025-03-16 19:05:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:09,540 INFO L225 Difference]: With dead ends: 464 [2025-03-16 19:05:09,540 INFO L226 Difference]: Without dead ends: 249 [2025-03-16 19:05:09,541 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-16 19:05:09,542 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 8 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 769 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-16 19:05:09,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 769 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-16 19:05:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-03-16 19:05:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 197 states have (on average 1.467005076142132) internal successors, (289), 200 states have internal predecessors, (289), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-16 19:05:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 375 transitions. [2025-03-16 19:05:09,557 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 375 transitions. Word has length 55 [2025-03-16 19:05:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:09,557 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 375 transitions. [2025-03-16 19:05:09,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-16 19:05:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 375 transitions. [2025-03-16 19:05:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:05:09,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:09,558 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] [2025-03-16 19:05:09,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:05:09,558 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -783604749, now seen corresponding path program 1 times [2025-03-16 19:05:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607588859] [2025-03-16 19:05:09,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:09,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:05:09,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:05:09,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:09,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 19:05:09,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:09,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607588859] [2025-03-16 19:05:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607588859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666082880] [2025-03-16 19:05:09,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:09,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:09,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:09,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:09,622 INFO L87 Difference]: Start difference. First operand 249 states and 375 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-16 19:05:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:09,658 INFO L93 Difference]: Finished difference Result 508 states and 776 transitions. [2025-03-16 19:05:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:09,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 55 [2025-03-16 19:05:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:09,660 INFO L225 Difference]: With dead ends: 508 [2025-03-16 19:05:09,660 INFO L226 Difference]: Without dead ends: 286 [2025-03-16 19:05:09,661 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-16 19:05:09,661 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 22 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:09,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 784 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-16 19:05:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2025-03-16 19:05:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 228 states have (on average 1.4254385964912282) internal successors, (325), 231 states have internal predecessors, (325), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-16 19:05:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 417 transitions. [2025-03-16 19:05:09,671 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 417 transitions. Word has length 55 [2025-03-16 19:05:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:09,672 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 417 transitions. [2025-03-16 19:05:09,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-16 19:05:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 417 transitions. [2025-03-16 19:05:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:05:09,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:09,672 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2025-03-16 19:05:09,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:05:09,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:09,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1681226408, now seen corresponding path program 1 times [2025-03-16 19:05:09,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246422365] [2025-03-16 19:05:09,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:09,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:05:09,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:05:09,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:09,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 19:05:09,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246422365] [2025-03-16 19:05:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246422365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:09,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794619285] [2025-03-16 19:05:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:09,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:09,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:09,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:09,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:09,755 INFO L87 Difference]: Start difference. First operand 284 states and 417 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-16 19:05:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:09,781 INFO L93 Difference]: Finished difference Result 520 states and 776 transitions. [2025-03-16 19:05:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:09,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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 73 [2025-03-16 19:05:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:09,784 INFO L225 Difference]: With dead ends: 520 [2025-03-16 19:05:09,784 INFO L226 Difference]: Without dead ends: 286 [2025-03-16 19:05:09,785 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-16 19:05:09,786 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1049 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-16 19:05:09,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1049 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-16 19:05:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2025-03-16 19:05:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 228 states have (on average 1.412280701754386) internal successors, (322), 231 states have internal predecessors, (322), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-16 19:05:09,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 414 transitions. [2025-03-16 19:05:09,800 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 414 transitions. Word has length 73 [2025-03-16 19:05:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:09,800 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 414 transitions. [2025-03-16 19:05:09,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-16 19:05:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 414 transitions. [2025-03-16 19:05:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:05:09,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:09,801 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 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-16 19:05:09,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:05:09,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:09,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:09,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1160033416, now seen corresponding path program 1 times [2025-03-16 19:05:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:09,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786610726] [2025-03-16 19:05:09,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:09,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:09,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:05:09,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:05:09,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:09,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-16 19:05:09,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:09,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786610726] [2025-03-16 19:05:09,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786610726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:09,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:09,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:09,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285782065] [2025-03-16 19:05:09,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:09,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:09,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:09,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:09,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:09,902 INFO L87 Difference]: Start difference. First operand 284 states and 414 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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-16 19:05:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:09,941 INFO L93 Difference]: Finished difference Result 555 states and 830 transitions. [2025-03-16 19:05:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 101 [2025-03-16 19:05:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:09,943 INFO L225 Difference]: With dead ends: 555 [2025-03-16 19:05:09,944 INFO L226 Difference]: Without dead ends: 326 [2025-03-16 19:05:09,944 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-16 19:05:09,945 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 23 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:09,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 784 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-16 19:05:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2025-03-16 19:05:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 264 states have (on average 1.375) internal successors, (363), 267 states have internal predecessors, (363), 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-16 19:05:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 461 transitions. [2025-03-16 19:05:09,955 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 461 transitions. Word has length 101 [2025-03-16 19:05:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:09,956 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 461 transitions. [2025-03-16 19:05:09,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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-16 19:05:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 461 transitions. [2025-03-16 19:05:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:05:09,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:09,956 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] [2025-03-16 19:05:09,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:05:09,956 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:09,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:09,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1365514498, now seen corresponding path program 1 times [2025-03-16 19:05:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:09,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976606341] [2025-03-16 19:05:09,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:09,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:09,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:05:09,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:05:09,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:09,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:10,034 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-16 19:05:10,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:10,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976606341] [2025-03-16 19:05:10,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976606341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:10,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:10,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:10,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334299693] [2025-03-16 19:05:10,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:10,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:10,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:10,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:10,036 INFO L87 Difference]: Start difference. First operand 324 states and 461 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-16 19:05:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:10,080 INFO L93 Difference]: Finished difference Result 581 states and 850 transitions. [2025-03-16 19:05:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:10,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 102 [2025-03-16 19:05:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:10,083 INFO L225 Difference]: With dead ends: 581 [2025-03-16 19:05:10,084 INFO L226 Difference]: Without dead ends: 318 [2025-03-16 19:05:10,085 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-16 19:05:10,085 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 9 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 752 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-16 19:05:10,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 752 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-16 19:05:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-03-16 19:05:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 259 states have (on average 1.3552123552123552) internal successors, (351), 262 states have internal predecessors, (351), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 19:05:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2025-03-16 19:05:10,100 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 102 [2025-03-16 19:05:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:10,100 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2025-03-16 19:05:10,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-16 19:05:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2025-03-16 19:05:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:05:10,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:10,101 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:10,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:05:10,101 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:10,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:10,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1319504916, now seen corresponding path program 1 times [2025-03-16 19:05:10,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:10,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155750817] [2025-03-16 19:05:10,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:10,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:05:10,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:05:10,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:10,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-03-16 19:05:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155750817] [2025-03-16 19:05:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155750817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500996556] [2025-03-16 19:05:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:10,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:10,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:10,201 INFO L87 Difference]: Start difference. First operand 318 states and 447 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 19:05:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:10,233 INFO L93 Difference]: Finished difference Result 557 states and 800 transitions. [2025-03-16 19:05:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:10,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 121 [2025-03-16 19:05:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:10,236 INFO L225 Difference]: With dead ends: 557 [2025-03-16 19:05:10,236 INFO L226 Difference]: Without dead ends: 320 [2025-03-16 19:05:10,237 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-16 19:05:10,237 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1033 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-16 19:05:10,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1033 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-16 19:05:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2025-03-16 19:05:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 259 states have (on average 1.3436293436293436) internal successors, (348), 262 states have internal predecessors, (348), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 19:05:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 444 transitions. [2025-03-16 19:05:10,252 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 444 transitions. Word has length 121 [2025-03-16 19:05:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:10,253 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 444 transitions. [2025-03-16 19:05:10,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 19:05:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 444 transitions. [2025-03-16 19:05:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 19:05:10,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:10,256 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 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, 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-16 19:05:10,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:05:10,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:10,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:10,257 INFO L85 PathProgramCache]: Analyzing trace with hash 720611692, now seen corresponding path program 1 times [2025-03-16 19:05:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:10,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362199692] [2025-03-16 19:05:10,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:10,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:10,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:05:10,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:05:10,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:10,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 19:05:10,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:10,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362199692] [2025-03-16 19:05:10,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362199692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:10,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:10,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715764433] [2025-03-16 19:05:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:10,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:10,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:10,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:10,364 INFO L87 Difference]: Start difference. First operand 318 states and 444 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 19:05:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:10,413 INFO L93 Difference]: Finished difference Result 520 states and 760 transitions. [2025-03-16 19:05:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:10,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 153 [2025-03-16 19:05:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:10,416 INFO L225 Difference]: With dead ends: 520 [2025-03-16 19:05:10,417 INFO L226 Difference]: Without dead ends: 316 [2025-03-16 19:05:10,417 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-16 19:05:10,418 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 7 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 720 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-16 19:05:10,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 720 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-16 19:05:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-03-16 19:05:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 258 states have (on average 1.3410852713178294) internal successors, (346), 261 states have internal predecessors, (346), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-16 19:05:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 440 transitions. [2025-03-16 19:05:10,433 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 440 transitions. Word has length 153 [2025-03-16 19:05:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:10,434 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 440 transitions. [2025-03-16 19:05:10,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 19:05:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 440 transitions. [2025-03-16 19:05:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:05:10,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:10,436 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:10,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:05:10,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:10,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash 630850624, now seen corresponding path program 1 times [2025-03-16 19:05:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:10,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601869196] [2025-03-16 19:05:10,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:10,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:05:10,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:05:10,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:10,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-03-16 19:05:10,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:10,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601869196] [2025-03-16 19:05:10,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601869196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:10,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:10,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:10,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536085445] [2025-03-16 19:05:10,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:10,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:10,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:10,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:10,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:10,579 INFO L87 Difference]: Start difference. First operand 316 states and 440 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:05:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:10,625 INFO L93 Difference]: Finished difference Result 460 states and 656 transitions. [2025-03-16 19:05:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 168 [2025-03-16 19:05:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:10,627 INFO L225 Difference]: With dead ends: 460 [2025-03-16 19:05:10,627 INFO L226 Difference]: Without dead ends: 299 [2025-03-16 19:05:10,628 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-16 19:05:10,628 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 32 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:10,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 697 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:10,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-16 19:05:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-03-16 19:05:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 244 states have (on average 1.3319672131147542) internal successors, (325), 247 states have internal predecessors, (325), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 19:05:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 413 transitions. [2025-03-16 19:05:10,643 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 413 transitions. Word has length 168 [2025-03-16 19:05:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:10,644 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 413 transitions. [2025-03-16 19:05:10,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:05:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 413 transitions. [2025-03-16 19:05:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-16 19:05:10,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:10,645 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:10,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:05:10,645 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:10,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash -180485529, now seen corresponding path program 1 times [2025-03-16 19:05:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:10,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522921554] [2025-03-16 19:05:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:10,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-16 19:05:10,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-16 19:05:10,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:10,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-16 19:05:10,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:10,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522921554] [2025-03-16 19:05:10,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522921554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:10,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:10,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:10,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667044316] [2025-03-16 19:05:10,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:10,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:10,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:10,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:10,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:10,755 INFO L87 Difference]: Start difference. First operand 299 states and 413 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:05:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:10,811 INFO L93 Difference]: Finished difference Result 443 states and 629 transitions. [2025-03-16 19:05:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:10,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 170 [2025-03-16 19:05:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:10,813 INFO L225 Difference]: With dead ends: 443 [2025-03-16 19:05:10,813 INFO L226 Difference]: Without dead ends: 280 [2025-03-16 19:05:10,814 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-16 19:05:10,815 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 28 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:10,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 700 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-16 19:05:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-16 19:05:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 228 states have (on average 1.3245614035087718) internal successors, (302), 231 states have internal predecessors, (302), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-16 19:05:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 384 transitions. [2025-03-16 19:05:10,827 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 384 transitions. Word has length 170 [2025-03-16 19:05:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:10,829 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 384 transitions. [2025-03-16 19:05:10,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:05:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 384 transitions. [2025-03-16 19:05:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 19:05:10,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:10,832 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:10,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:05:10,832 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:10,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash -511032082, now seen corresponding path program 1 times [2025-03-16 19:05:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:10,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646530303] [2025-03-16 19:05:10,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:10,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:10,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 19:05:10,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 19:05:10,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:10,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 19:05:10,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:10,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646530303] [2025-03-16 19:05:10,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646530303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:10,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:10,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702057432] [2025-03-16 19:05:10,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:10,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:10,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:10,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:10,939 INFO L87 Difference]: Start difference. First operand 280 states and 384 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-16 19:05:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:10,963 INFO L93 Difference]: Finished difference Result 424 states and 600 transitions. [2025-03-16 19:05:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:10,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 171 [2025-03-16 19:05:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:10,965 INFO L225 Difference]: With dead ends: 424 [2025-03-16 19:05:10,965 INFO L226 Difference]: Without dead ends: 280 [2025-03-16 19:05:10,966 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-16 19:05:10,966 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1011 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-16 19:05:10,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1011 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-16 19:05:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-16 19:05:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 231 states have internal predecessors, (296), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-16 19:05:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 378 transitions. [2025-03-16 19:05:10,976 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 378 transitions. Word has length 171 [2025-03-16 19:05:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:10,977 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 378 transitions. [2025-03-16 19:05:10,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-16 19:05:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 378 transitions. [2025-03-16 19:05:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 19:05:10,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:10,978 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 1, 1, 1, 1, 1, 1, 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-16 19:05:10,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:05:10,978 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:10,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash -667897667, now seen corresponding path program 1 times [2025-03-16 19:05:10,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:10,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394034950] [2025-03-16 19:05:10,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:10,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:10,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 19:05:10,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 19:05:10,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:10,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-16 19:05:11,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:11,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394034950] [2025-03-16 19:05:11,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394034950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:11,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391861361] [2025-03-16 19:05:11,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:11,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:11,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:11,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:05:11,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:05:11,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 19:05:11,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 19:05:11,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:11,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:11,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 19:05:11,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-16 19:05:11,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-16 19:05:11,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391861361] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:11,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 19:05:11,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2025-03-16 19:05:11,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784753554] [2025-03-16 19:05:11,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:11,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:11,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:11,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:11,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:11,369 INFO L87 Difference]: Start difference. First operand 280 states and 378 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-16 19:05:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:11,406 INFO L93 Difference]: Finished difference Result 444 states and 621 transitions. [2025-03-16 19:05:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:11,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 177 [2025-03-16 19:05:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:11,408 INFO L225 Difference]: With dead ends: 444 [2025-03-16 19:05:11,408 INFO L226 Difference]: Without dead ends: 259 [2025-03-16 19:05:11,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 353 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-16 19:05:11,409 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 19 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:11,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 700 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-16 19:05:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-16 19:05:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 213 states have internal predecessors, (271), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 19:05:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 347 transitions. [2025-03-16 19:05:11,420 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 347 transitions. Word has length 177 [2025-03-16 19:05:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:11,420 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 347 transitions. [2025-03-16 19:05:11,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-16 19:05:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 347 transitions. [2025-03-16 19:05:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 19:05:11,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:11,422 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 1, 1, 1, 1, 1, 1, 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-16 19:05:11,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:11,622 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,SelfDestructingSolverStorable16 [2025-03-16 19:05:11,622 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:11,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1556915090, now seen corresponding path program 1 times [2025-03-16 19:05:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:11,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385999341] [2025-03-16 19:05:11,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:11,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 19:05:11,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 19:05:11,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:11,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-16 19:05:11,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385999341] [2025-03-16 19:05:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385999341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:11,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:11,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160417103] [2025-03-16 19:05:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:11,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:11,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:11,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:11,717 INFO L87 Difference]: Start difference. First operand 259 states and 347 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-16 19:05:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:11,744 INFO L93 Difference]: Finished difference Result 400 states and 561 transitions. [2025-03-16 19:05:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:11,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 201 [2025-03-16 19:05:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:11,748 INFO L225 Difference]: With dead ends: 400 [2025-03-16 19:05:11,748 INFO L226 Difference]: Without dead ends: 263 [2025-03-16 19:05:11,748 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-16 19:05:11,749 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 3 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 740 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-16 19:05:11,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 740 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-16 19:05:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-16 19:05:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 213 states have (on average 1.2863849765258215) internal successors, (274), 216 states have internal predecessors, (274), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 19:05:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 350 transitions. [2025-03-16 19:05:11,762 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 350 transitions. Word has length 201 [2025-03-16 19:05:11,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:11,762 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 350 transitions. [2025-03-16 19:05:11,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-16 19:05:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 350 transitions. [2025-03-16 19:05:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 19:05:11,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:11,765 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:11,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:05:11,765 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:11,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:11,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1740050509, now seen corresponding path program 1 times [2025-03-16 19:05:11,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:11,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861773525] [2025-03-16 19:05:11,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:11,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:11,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 19:05:11,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 19:05:11,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:11,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-16 19:05:11,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:11,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861773525] [2025-03-16 19:05:11,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861773525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:11,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:11,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:11,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684783452] [2025-03-16 19:05:11,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:11,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:11,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:11,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:11,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:11,867 INFO L87 Difference]: Start difference. First operand 263 states and 350 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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-16 19:05:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:11,895 INFO L93 Difference]: Finished difference Result 409 states and 569 transitions. [2025-03-16 19:05:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:11,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 208 [2025-03-16 19:05:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:11,897 INFO L225 Difference]: With dead ends: 409 [2025-03-16 19:05:11,897 INFO L226 Difference]: Without dead ends: 268 [2025-03-16 19:05:11,897 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-16 19:05:11,898 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 742 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-16 19:05:11,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 742 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-16 19:05:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-16 19:05:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 217 states have (on average 1.2811059907834101) internal successors, (278), 220 states have internal predecessors, (278), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 19:05:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 354 transitions. [2025-03-16 19:05:11,907 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 354 transitions. Word has length 208 [2025-03-16 19:05:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:11,908 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 354 transitions. [2025-03-16 19:05:11,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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-16 19:05:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 354 transitions. [2025-03-16 19:05:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 19:05:11,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:11,932 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 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] [2025-03-16 19:05:11,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:05:11,932 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:11,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1759932189, now seen corresponding path program 1 times [2025-03-16 19:05:11,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:11,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891647422] [2025-03-16 19:05:11,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:11,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:11,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 19:05:11,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 19:05:11,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:11,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-16 19:05:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891647422] [2025-03-16 19:05:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891647422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569561579] [2025-03-16 19:05:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:12,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:12,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:12,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:12,054 INFO L87 Difference]: Start difference. First operand 268 states and 354 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-16 19:05:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:12,084 INFO L93 Difference]: Finished difference Result 413 states and 569 transitions. [2025-03-16 19:05:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 216 [2025-03-16 19:05:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:12,086 INFO L225 Difference]: With dead ends: 413 [2025-03-16 19:05:12,086 INFO L226 Difference]: Without dead ends: 267 [2025-03-16 19:05:12,087 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-16 19:05:12,087 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 5 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 732 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-16 19:05:12,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 732 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-16 19:05:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-16 19:05:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 217 states have (on average 1.2672811059907834) internal successors, (275), 219 states have internal predecessors, (275), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-16 19:05:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 349 transitions. [2025-03-16 19:05:12,100 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 349 transitions. Word has length 216 [2025-03-16 19:05:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:12,100 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 349 transitions. [2025-03-16 19:05:12,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-16 19:05:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 349 transitions. [2025-03-16 19:05:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 19:05:12,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:12,102 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:12,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:05:12,102 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:12,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash -772204634, now seen corresponding path program 1 times [2025-03-16 19:05:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:12,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145828831] [2025-03-16 19:05:12,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:12,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:12,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 19:05:12,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 19:05:12,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:12,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-16 19:05:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145828831] [2025-03-16 19:05:12,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145828831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:12,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:12,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:12,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762817456] [2025-03-16 19:05:12,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:12,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:12,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:12,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:12,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:12,206 INFO L87 Difference]: Start difference. First operand 267 states and 349 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-16 19:05:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:12,218 INFO L93 Difference]: Finished difference Result 411 states and 558 transitions. [2025-03-16 19:05:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 224 [2025-03-16 19:05:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:12,222 INFO L225 Difference]: With dead ends: 411 [2025-03-16 19:05:12,222 INFO L226 Difference]: Without dead ends: 266 [2025-03-16 19:05:12,222 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-16 19:05:12,223 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 488 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-16 19:05:12,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-16 19:05:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-16 19:05:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 217 states have (on average 1.262672811059908) internal successors, (274), 218 states have internal predecessors, (274), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-16 19:05:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 346 transitions. [2025-03-16 19:05:12,236 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 346 transitions. Word has length 224 [2025-03-16 19:05:12,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:12,236 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 346 transitions. [2025-03-16 19:05:12,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-16 19:05:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 346 transitions. [2025-03-16 19:05:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 19:05:12,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:12,238 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:12,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:05:12,238 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:12,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:12,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1838399406, now seen corresponding path program 1 times [2025-03-16 19:05:12,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:12,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877615636] [2025-03-16 19:05:12,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:12,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 19:05:12,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 19:05:12,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:12,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-16 19:05:12,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:12,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877615636] [2025-03-16 19:05:12,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877615636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:12,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:12,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:12,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336265468] [2025-03-16 19:05:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:12,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:12,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:12,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:12,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:12,448 INFO L87 Difference]: Start difference. First operand 266 states and 346 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 19:05:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:12,531 INFO L93 Difference]: Finished difference Result 615 states and 826 transitions. [2025-03-16 19:05:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:12,533 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 226 [2025-03-16 19:05:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:12,536 INFO L225 Difference]: With dead ends: 615 [2025-03-16 19:05:12,536 INFO L226 Difference]: Without dead ends: 471 [2025-03-16 19:05:12,536 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-16 19:05:12,537 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 312 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:12,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 690 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-16 19:05:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 417. [2025-03-16 19:05:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 338 states have (on average 1.3076923076923077) internal successors, (442), 340 states have internal predecessors, (442), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-16 19:05:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 550 transitions. [2025-03-16 19:05:12,560 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 550 transitions. Word has length 226 [2025-03-16 19:05:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:12,560 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 550 transitions. [2025-03-16 19:05:12,560 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 19:05:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 550 transitions. [2025-03-16 19:05:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 19:05:12,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:12,563 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:12,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:05:12,563 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:12,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:12,563 INFO L85 PathProgramCache]: Analyzing trace with hash 746594937, now seen corresponding path program 1 times [2025-03-16 19:05:12,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:12,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319847172] [2025-03-16 19:05:12,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:12,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:12,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 19:05:12,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 19:05:12,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:12,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-16 19:05:12,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:12,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319847172] [2025-03-16 19:05:12,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319847172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:12,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:12,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190634208] [2025-03-16 19:05:12,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:12,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:12,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:12,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:12,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:12,666 INFO L87 Difference]: Start difference. First operand 417 states and 550 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 19:05:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:12,697 INFO L93 Difference]: Finished difference Result 885 states and 1220 transitions. [2025-03-16 19:05:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:12,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 253 [2025-03-16 19:05:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:12,701 INFO L225 Difference]: With dead ends: 885 [2025-03-16 19:05:12,701 INFO L226 Difference]: Without dead ends: 658 [2025-03-16 19:05:12,701 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-16 19:05:12,702 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 171 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:12,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 509 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-16 19:05:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 496. [2025-03-16 19:05:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 407 states have (on average 1.3194103194103195) internal successors, (537), 410 states have internal predecessors, (537), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-16 19:05:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 655 transitions. [2025-03-16 19:05:12,727 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 655 transitions. Word has length 253 [2025-03-16 19:05:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:12,727 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 655 transitions. [2025-03-16 19:05:12,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 19:05:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 655 transitions. [2025-03-16 19:05:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 19:05:12,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:12,730 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:12,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:05:12,730 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:12,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash 904564993, now seen corresponding path program 1 times [2025-03-16 19:05:12,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:12,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646407573] [2025-03-16 19:05:12,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:12,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 19:05:12,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 19:05:12,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:12,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-16 19:05:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646407573] [2025-03-16 19:05:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646407573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:12,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:12,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515780923] [2025-03-16 19:05:12,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:12,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:12,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:12,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:12,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:12,819 INFO L87 Difference]: Start difference. First operand 496 states and 655 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 19:05:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:12,862 INFO L93 Difference]: Finished difference Result 1056 states and 1451 transitions. [2025-03-16 19:05:12,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:12,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 254 [2025-03-16 19:05:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:12,866 INFO L225 Difference]: With dead ends: 1056 [2025-03-16 19:05:12,866 INFO L226 Difference]: Without dead ends: 779 [2025-03-16 19:05:12,867 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-16 19:05:12,868 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 173 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:12,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 526 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-16 19:05:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 604. [2025-03-16 19:05:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 503 states have (on average 1.333996023856859) internal successors, (671), 508 states have internal predecessors, (671), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-16 19:05:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 801 transitions. [2025-03-16 19:05:12,895 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 801 transitions. Word has length 254 [2025-03-16 19:05:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:12,896 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 801 transitions. [2025-03-16 19:05:12,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 19:05:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 801 transitions. [2025-03-16 19:05:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-16 19:05:12,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:12,899 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:12,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:05:12,899 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash -431047850, now seen corresponding path program 1 times [2025-03-16 19:05:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448673464] [2025-03-16 19:05:12,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:12,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 19:05:12,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 19:05:12,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:12,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-16 19:05:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448673464] [2025-03-16 19:05:12,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448673464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:12,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:12,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158634966] [2025-03-16 19:05:12,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:12,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:12,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:12,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:12,990 INFO L87 Difference]: Start difference. First operand 604 states and 801 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:13,034 INFO L93 Difference]: Finished difference Result 1266 states and 1745 transitions. [2025-03-16 19:05:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:13,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 255 [2025-03-16 19:05:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:13,040 INFO L225 Difference]: With dead ends: 1266 [2025-03-16 19:05:13,040 INFO L226 Difference]: Without dead ends: 913 [2025-03-16 19:05:13,041 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-16 19:05:13,041 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 174 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:13,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 542 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-16 19:05:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 710. [2025-03-16 19:05:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 601 states have (on average 1.3560732113144758) internal successors, (815), 610 states have internal predecessors, (815), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 19:05:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 953 transitions. [2025-03-16 19:05:13,074 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 953 transitions. Word has length 255 [2025-03-16 19:05:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:13,074 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 953 transitions. [2025-03-16 19:05:13,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 953 transitions. [2025-03-16 19:05:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-16 19:05:13,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:13,077 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:13,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:05:13,077 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:13,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1853815605, now seen corresponding path program 1 times [2025-03-16 19:05:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120988349] [2025-03-16 19:05:13,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:13,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 19:05:13,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 19:05:13,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:13,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-16 19:05:13,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120988349] [2025-03-16 19:05:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120988349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433605548] [2025-03-16 19:05:13,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:13,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:13,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:13,249 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:05:13,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:05:13,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 19:05:13,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 19:05:13,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:13,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:13,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:05:13,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-16 19:05:13,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:13,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433605548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:13,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:13,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-16 19:05:13,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969992057] [2025-03-16 19:05:13,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:13,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:13,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:13,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:13,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:05:13,465 INFO L87 Difference]: Start difference. First operand 710 states and 953 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:13,580 INFO L93 Difference]: Finished difference Result 1173 states and 1617 transitions. [2025-03-16 19:05:13,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:13,580 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 255 [2025-03-16 19:05:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:13,584 INFO L225 Difference]: With dead ends: 1173 [2025-03-16 19:05:13,584 INFO L226 Difference]: Without dead ends: 710 [2025-03-16 19:05:13,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:05:13,585 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 31 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 667 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:13,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 667 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-03-16 19:05:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2025-03-16 19:05:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 601 states have (on average 1.346089850249584) internal successors, (809), 610 states have internal predecessors, (809), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 19:05:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 947 transitions. [2025-03-16 19:05:13,615 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 947 transitions. Word has length 255 [2025-03-16 19:05:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:13,616 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 947 transitions. [2025-03-16 19:05:13,616 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 947 transitions. [2025-03-16 19:05:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 19:05:13,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:13,618 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:13,625 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-16 19:05:13,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:13,819 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:13,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:13,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1242775492, now seen corresponding path program 1 times [2025-03-16 19:05:13,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:13,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992487615] [2025-03-16 19:05:13,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:13,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:13,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 19:05:13,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 19:05:13,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:13,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2025-03-16 19:05:13,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992487615] [2025-03-16 19:05:13,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992487615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161598222] [2025-03-16 19:05:13,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:13,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:13,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:13,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:05:13,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:05:14,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 19:05:14,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 19:05:14,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:14,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:14,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:05:14,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-16 19:05:14,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161598222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-16 19:05:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153851153] [2025-03-16 19:05:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:14,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:05:14,190 INFO L87 Difference]: Start difference. First operand 710 states and 947 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:14,263 INFO L93 Difference]: Finished difference Result 1173 states and 1603 transitions. [2025-03-16 19:05:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:14,263 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 256 [2025-03-16 19:05:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:14,267 INFO L225 Difference]: With dead ends: 1173 [2025-03-16 19:05:14,269 INFO L226 Difference]: Without dead ends: 722 [2025-03-16 19:05:14,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:05:14,270 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 7 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 675 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-16 19:05:14,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 675 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-16 19:05:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2025-03-16 19:05:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 611 states have (on average 1.3469721767594107) internal successors, (823), 620 states have internal predecessors, (823), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 19:05:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 961 transitions. [2025-03-16 19:05:14,302 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 961 transitions. Word has length 256 [2025-03-16 19:05:14,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:14,302 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 961 transitions. [2025-03-16 19:05:14,302 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 961 transitions. [2025-03-16 19:05:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-16 19:05:14,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:14,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:14,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:14,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 19:05:14,506 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:14,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash -757626965, now seen corresponding path program 1 times [2025-03-16 19:05:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:14,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035482406] [2025-03-16 19:05:14,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:14,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:14,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-16 19:05:14,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-16 19:05:14,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:14,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-16 19:05:14,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:14,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035482406] [2025-03-16 19:05:14,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035482406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:14,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:14,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571629144] [2025-03-16 19:05:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:14,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:14,675 INFO L87 Difference]: Start difference. First operand 722 states and 961 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:14,700 INFO L93 Difference]: Finished difference Result 1187 states and 1617 transitions. [2025-03-16 19:05:14,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:14,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 257 [2025-03-16 19:05:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:14,703 INFO L225 Difference]: With dead ends: 1187 [2025-03-16 19:05:14,703 INFO L226 Difference]: Without dead ends: 703 [2025-03-16 19:05:14,704 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-16 19:05:14,705 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:14,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-16 19:05:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2025-03-16 19:05:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 593 states have (on average 1.3288364249578415) internal successors, (788), 601 states have internal predecessors, (788), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 19:05:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 925 transitions. [2025-03-16 19:05:14,729 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 925 transitions. Word has length 257 [2025-03-16 19:05:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:14,729 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 925 transitions. [2025-03-16 19:05:14,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 925 transitions. [2025-03-16 19:05:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 19:05:14,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:14,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:14,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:05:14,731 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:14,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash 532373398, now seen corresponding path program 1 times [2025-03-16 19:05:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049813307] [2025-03-16 19:05:14,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:14,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 19:05:14,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 19:05:14,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:14,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-16 19:05:15,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:15,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049813307] [2025-03-16 19:05:15,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049813307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:15,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:15,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:05:15,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333190997] [2025-03-16 19:05:15,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:15,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:05:15,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:15,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:05:15,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:15,046 INFO L87 Difference]: Start difference. First operand 703 states and 925 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:05:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:15,125 INFO L93 Difference]: Finished difference Result 1017 states and 1417 transitions. [2025-03-16 19:05:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:05:15,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 258 [2025-03-16 19:05:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:15,132 INFO L225 Difference]: With dead ends: 1017 [2025-03-16 19:05:15,133 INFO L226 Difference]: Without dead ends: 1015 [2025-03-16 19:05:15,134 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-16 19:05:15,136 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 121 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1731 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-16 19:05:15,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1731 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-16 19:05:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 709. [2025-03-16 19:05:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 597 states have (on average 1.3266331658291457) internal successors, (792), 606 states have internal predecessors, (792), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 19:05:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 931 transitions. [2025-03-16 19:05:15,179 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 931 transitions. Word has length 258 [2025-03-16 19:05:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:15,179 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 931 transitions. [2025-03-16 19:05:15,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:05:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 931 transitions. [2025-03-16 19:05:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 19:05:15,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:15,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:05:15,183 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:15,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1585658109, now seen corresponding path program 1 times [2025-03-16 19:05:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938501423] [2025-03-16 19:05:15,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:15,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 19:05:15,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 19:05:15,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:15,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-16 19:05:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938501423] [2025-03-16 19:05:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938501423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700095413] [2025-03-16 19:05:15,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:15,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:15,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:15,438 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:05:15,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 19:05:15,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 19:05:15,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 19:05:15,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:15,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:15,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 19:05:15,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 248 proven. 33 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-16 19:05:15,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-16 19:05:16,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700095413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:16,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:16,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-16 19:05:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251003960] [2025-03-16 19:05:16,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:16,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:05:16,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:16,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:05:16,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:05:16,154 INFO L87 Difference]: Start difference. First operand 709 states and 931 transitions. Second operand has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2025-03-16 19:05:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:16,526 INFO L93 Difference]: Finished difference Result 1713 states and 2332 transitions. [2025-03-16 19:05:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:05:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 266 [2025-03-16 19:05:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:16,532 INFO L225 Difference]: With dead ends: 1713 [2025-03-16 19:05:16,532 INFO L226 Difference]: Without dead ends: 1261 [2025-03-16 19:05:16,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 523 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-16 19:05:16,536 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 243 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:16,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 3601 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:05:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-03-16 19:05:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 976. [2025-03-16 19:05:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 824 states have (on average 1.3131067961165048) internal successors, (1082), 834 states have internal predecessors, (1082), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2025-03-16 19:05:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1274 transitions. [2025-03-16 19:05:16,580 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1274 transitions. Word has length 266 [2025-03-16 19:05:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:16,580 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1274 transitions. [2025-03-16 19:05:16,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2025-03-16 19:05:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1274 transitions. [2025-03-16 19:05:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 19:05:16,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:16,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:16,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:16,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:16,784 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:16,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1747695170, now seen corresponding path program 1 times [2025-03-16 19:05:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:16,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601083644] [2025-03-16 19:05:16,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:16,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 19:05:16,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 19:05:16,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:16,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-03-16 19:05:16,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:16,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601083644] [2025-03-16 19:05:16,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601083644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:16,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371377200] [2025-03-16 19:05:16,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:16,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:16,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:16,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:05:16,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 19:05:16,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 19:05:17,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 19:05:17,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:17,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:17,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 19:05:17,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-16 19:05:17,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:17,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371377200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:17,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:17,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-16 19:05:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138157612] [2025-03-16 19:05:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:17,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:17,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:17,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:17,064 INFO L87 Difference]: Start difference. First operand 976 states and 1274 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 19:05:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:17,137 INFO L93 Difference]: Finished difference Result 1819 states and 2416 transitions. [2025-03-16 19:05:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:17,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 266 [2025-03-16 19:05:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:17,141 INFO L225 Difference]: With dead ends: 1819 [2025-03-16 19:05:17,141 INFO L226 Difference]: Without dead ends: 960 [2025-03-16 19:05:17,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 268 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-16 19:05:17,143 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 4 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 672 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.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:17,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 672 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-16 19:05:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2025-03-16 19:05:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 813 states have (on average 1.3013530135301352) internal successors, (1058), 823 states have internal predecessors, (1058), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2025-03-16 19:05:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1241 transitions. [2025-03-16 19:05:17,195 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1241 transitions. Word has length 266 [2025-03-16 19:05:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:17,195 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1241 transitions. [2025-03-16 19:05:17,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 19:05:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1241 transitions. [2025-03-16 19:05:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-16 19:05:17,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:17,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:17,205 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-16 19:05:17,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:17,399 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:17,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash 198253553, now seen corresponding path program 1 times [2025-03-16 19:05:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845120159] [2025-03-16 19:05:17,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:17,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-16 19:05:17,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-16 19:05:17,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:17,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-03-16 19:05:17,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845120159] [2025-03-16 19:05:17,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845120159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:17,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242831951] [2025-03-16 19:05:17,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:17,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:17,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:17,478 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:05:17,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 19:05:17,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-16 19:05:17,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-16 19:05:17,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:17,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:17,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 19:05:17,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-16 19:05:17,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:17,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242831951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:17,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:17,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-16 19:05:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657543460] [2025-03-16 19:05:17,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:17,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:17,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:17,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:17,670 INFO L87 Difference]: Start difference. First operand 960 states and 1241 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-16 19:05:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:17,736 INFO L93 Difference]: Finished difference Result 1668 states and 2201 transitions. [2025-03-16 19:05:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:17,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 269 [2025-03-16 19:05:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:17,740 INFO L225 Difference]: With dead ends: 1668 [2025-03-16 19:05:17,740 INFO L226 Difference]: Without dead ends: 816 [2025-03-16 19:05:17,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 270 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-16 19:05:17,742 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 4 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 700 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-16 19:05:17,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 700 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-16 19:05:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2025-03-16 19:05:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 687 states have (on average 1.304221251819505) internal successors, (896), 697 states have internal predecessors, (896), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-16 19:05:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1057 transitions. [2025-03-16 19:05:17,773 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1057 transitions. Word has length 269 [2025-03-16 19:05:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:17,774 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1057 transitions. [2025-03-16 19:05:17,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-16 19:05:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1057 transitions. [2025-03-16 19:05:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 19:05:17,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:17,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:17,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:17,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:17,976 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:17,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash -393251133, now seen corresponding path program 1 times [2025-03-16 19:05:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946298594] [2025-03-16 19:05:17,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:17,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 19:05:18,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 19:05:18,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:18,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 20 proven. 141 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-16 19:05:19,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:19,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946298594] [2025-03-16 19:05:19,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946298594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:19,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762701999] [2025-03-16 19:05:19,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:19,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:19,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:19,129 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:05:19,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 19:05:19,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 19:05:19,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 19:05:19,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:19,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:19,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:05:19,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 19:05:19,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:19,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762701999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:19,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:19,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 25 [2025-03-16 19:05:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280918305] [2025-03-16 19:05:19,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:19,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:05:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:19,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:05:19,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:05:19,554 INFO L87 Difference]: Start difference. First operand 816 states and 1057 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:20,137 INFO L93 Difference]: Finished difference Result 2174 states and 2821 transitions. [2025-03-16 19:05:20,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:05:20,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 281 [2025-03-16 19:05:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:20,145 INFO L225 Difference]: With dead ends: 2174 [2025-03-16 19:05:20,145 INFO L226 Difference]: Without dead ends: 1715 [2025-03-16 19:05:20,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 19:05:20,147 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 616 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:20,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 2752 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:05:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-03-16 19:05:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1349. [2025-03-16 19:05:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1122 states have (on average 1.2825311942959001) internal successors, (1439), 1137 states have internal predecessors, (1439), 149 states have call successors, (149), 78 states have call predecessors, (149), 77 states have return successors, (148), 140 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-16 19:05:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1736 transitions. [2025-03-16 19:05:20,213 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1736 transitions. Word has length 281 [2025-03-16 19:05:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:20,213 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 1736 transitions. [2025-03-16 19:05:20,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1736 transitions. [2025-03-16 19:05:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 19:05:20,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:20,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:20,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:20,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-16 19:05:20,419 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:20,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2136121216, now seen corresponding path program 1 times [2025-03-16 19:05:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682363518] [2025-03-16 19:05:20,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:20,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:20,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:20,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:20,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-03-16 19:05:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:20,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682363518] [2025-03-16 19:05:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682363518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:20,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:20,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:05:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109770443] [2025-03-16 19:05:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:20,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:05:20,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:20,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:05:20,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:20,558 INFO L87 Difference]: Start difference. First operand 1349 states and 1736 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:20,656 INFO L93 Difference]: Finished difference Result 2491 states and 3296 transitions. [2025-03-16 19:05:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:05:20,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 287 [2025-03-16 19:05:20,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:20,662 INFO L225 Difference]: With dead ends: 2491 [2025-03-16 19:05:20,662 INFO L226 Difference]: Without dead ends: 1484 [2025-03-16 19:05:20,664 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-16 19:05:20,665 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 34 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:20,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 978 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-03-16 19:05:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1442. [2025-03-16 19:05:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1194 states have (on average 1.2931323283082077) internal successors, (1544), 1209 states have internal predecessors, (1544), 170 states have call successors, (170), 78 states have call predecessors, (170), 77 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-16 19:05:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 1883 transitions. [2025-03-16 19:05:20,725 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 1883 transitions. Word has length 287 [2025-03-16 19:05:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:20,726 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 1883 transitions. [2025-03-16 19:05:20,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1883 transitions. [2025-03-16 19:05:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 19:05:20,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:20,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:20,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:05:20,728 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:20,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash -926569922, now seen corresponding path program 1 times [2025-03-16 19:05:20,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:20,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833045913] [2025-03-16 19:05:20,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:20,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:20,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:20,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:20,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:20,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2025-03-16 19:05:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833045913] [2025-03-16 19:05:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833045913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735443006] [2025-03-16 19:05:21,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:21,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:21,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:21,316 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:05:21,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 19:05:21,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:21,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:21,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:21,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:21,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:05:21,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 19:05:21,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:21,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735443006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:21,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:21,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 19 [2025-03-16 19:05:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496571150] [2025-03-16 19:05:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:21,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:05:21,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:21,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:05:21,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:05:21,636 INFO L87 Difference]: Start difference. First operand 1442 states and 1883 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:22,195 INFO L93 Difference]: Finished difference Result 3769 states and 4918 transitions. [2025-03-16 19:05:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:05:22,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 287 [2025-03-16 19:05:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:22,205 INFO L225 Difference]: With dead ends: 3769 [2025-03-16 19:05:22,206 INFO L226 Difference]: Without dead ends: 2670 [2025-03-16 19:05:22,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:05:22,209 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 611 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:22,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 2786 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:05:22,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2025-03-16 19:05:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 1900. [2025-03-16 19:05:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1572 states have (on average 1.2818066157760815) internal successors, (2015), 1591 states have internal predecessors, (2015), 230 states have call successors, (230), 98 states have call predecessors, (230), 97 states have return successors, (229), 217 states have call predecessors, (229), 229 states have call successors, (229) [2025-03-16 19:05:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2474 transitions. [2025-03-16 19:05:22,293 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2474 transitions. Word has length 287 [2025-03-16 19:05:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:22,293 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2474 transitions. [2025-03-16 19:05:22,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2474 transitions. [2025-03-16 19:05:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 19:05:22,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:22,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:22,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:22,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-16 19:05:22,496 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:22,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash -483042498, now seen corresponding path program 1 times [2025-03-16 19:05:22,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:22,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499668603] [2025-03-16 19:05:22,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:22,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:22,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:22,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:22,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:22,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-03-16 19:05:23,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:23,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499668603] [2025-03-16 19:05:23,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499668603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:23,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276308586] [2025-03-16 19:05:23,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:23,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:23,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:23,039 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-16 19:05:23,040 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-16 19:05:23,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:23,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:23,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:23,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:23,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:05:23,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-03-16 19:05:23,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:23,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276308586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:23,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:23,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 13 [2025-03-16 19:05:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016702373] [2025-03-16 19:05:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:23,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:05:23,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:23,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:05:23,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:05:23,321 INFO L87 Difference]: Start difference. First operand 1900 states and 2474 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:23,813 INFO L93 Difference]: Finished difference Result 3819 states and 4970 transitions. [2025-03-16 19:05:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:05:23,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 287 [2025-03-16 19:05:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:23,823 INFO L225 Difference]: With dead ends: 3819 [2025-03-16 19:05:23,823 INFO L226 Difference]: Without dead ends: 2331 [2025-03-16 19:05:23,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:05:23,827 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 601 mSDsluCounter, 2383 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:23,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2749 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:05:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2025-03-16 19:05:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 1857. [2025-03-16 19:05:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1541 states have (on average 1.27384815055159) internal successors, (1963), 1560 states have internal predecessors, (1963), 218 states have call successors, (218), 98 states have call predecessors, (218), 97 states have return successors, (217), 205 states have call predecessors, (217), 217 states have call successors, (217) [2025-03-16 19:05:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2398 transitions. [2025-03-16 19:05:23,899 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2398 transitions. Word has length 287 [2025-03-16 19:05:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:23,899 INFO L471 AbstractCegarLoop]: Abstraction has 1857 states and 2398 transitions. [2025-03-16 19:05:23,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2398 transitions. [2025-03-16 19:05:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 19:05:23,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:23,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:23,910 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-16 19:05:24,102 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,SelfDestructingSolverStorable35 [2025-03-16 19:05:24,102 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:24,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1534646785, now seen corresponding path program 1 times [2025-03-16 19:05:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:24,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919635023] [2025-03-16 19:05:24,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:24,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:24,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:24,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:24,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:24,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-03-16 19:05:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919635023] [2025-03-16 19:05:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919635023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:24,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177915692] [2025-03-16 19:05:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:24,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:24,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:24,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:24,238 INFO L87 Difference]: Start difference. First operand 1857 states and 2398 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-16 19:05:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:24,560 INFO L93 Difference]: Finished difference Result 3779 states and 4898 transitions. [2025-03-16 19:05:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:05:24,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 287 [2025-03-16 19:05:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:24,570 INFO L225 Difference]: With dead ends: 3779 [2025-03-16 19:05:24,570 INFO L226 Difference]: Without dead ends: 2282 [2025-03-16 19:05:24,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:05:24,573 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 538 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:24,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 774 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:05:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2025-03-16 19:05:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 1759. [2025-03-16 19:05:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1458 states have (on average 1.2736625514403292) internal successors, (1857), 1476 states have internal predecessors, (1857), 208 states have call successors, (208), 93 states have call predecessors, (208), 92 states have return successors, (207), 196 states have call predecessors, (207), 207 states have call successors, (207) [2025-03-16 19:05:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2272 transitions. [2025-03-16 19:05:24,685 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2272 transitions. Word has length 287 [2025-03-16 19:05:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:24,685 INFO L471 AbstractCegarLoop]: Abstraction has 1759 states and 2272 transitions. [2025-03-16 19:05:24,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-16 19:05:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2272 transitions. [2025-03-16 19:05:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-16 19:05:24,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:24,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:24,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:05:24,689 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:24,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash -772509736, now seen corresponding path program 1 times [2025-03-16 19:05:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:24,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41283471] [2025-03-16 19:05:24,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:24,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-16 19:05:24,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-16 19:05:24,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:24,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-03-16 19:05:24,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:24,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41283471] [2025-03-16 19:05:24,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41283471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:24,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:24,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:24,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856689957] [2025-03-16 19:05:24,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:24,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:24,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:24,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:24,824 INFO L87 Difference]: Start difference. First operand 1759 states and 2272 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), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 19:05:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:25,039 INFO L93 Difference]: Finished difference Result 3227 states and 4190 transitions. [2025-03-16 19:05:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:25,039 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), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 295 [2025-03-16 19:05:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:25,049 INFO L225 Difference]: With dead ends: 3227 [2025-03-16 19:05:25,051 INFO L226 Difference]: Without dead ends: 1820 [2025-03-16 19:05:25,054 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-16 19:05:25,055 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 425 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:25,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 884 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2025-03-16 19:05:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1581. [2025-03-16 19:05:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1318 states have (on average 1.251896813353566) internal successors, (1650), 1328 states have internal predecessors, (1650), 182 states have call successors, (182), 80 states have call predecessors, (182), 80 states have return successors, (182), 172 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-16 19:05:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2014 transitions. [2025-03-16 19:05:25,122 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2014 transitions. Word has length 295 [2025-03-16 19:05:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:25,123 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2014 transitions. [2025-03-16 19:05:25,123 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), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 19:05:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2014 transitions. [2025-03-16 19:05:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-16 19:05:25,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:25,126 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, 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] [2025-03-16 19:05:25,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:05:25,126 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:25,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2043079299, now seen corresponding path program 1 times [2025-03-16 19:05:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:25,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71946360] [2025-03-16 19:05:25,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:25,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:25,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 19:05:25,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 19:05:25,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:25,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-16 19:05:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71946360] [2025-03-16 19:05:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71946360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:25,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:25,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:05:25,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773700019] [2025-03-16 19:05:25,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:25,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:05:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:25,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:05:25,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:05:25,700 INFO L87 Difference]: Start difference. First operand 1581 states and 2014 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-16 19:05:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:25,904 INFO L93 Difference]: Finished difference Result 3350 states and 4291 transitions. [2025-03-16 19:05:25,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:05:25,905 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) Word has length 335 [2025-03-16 19:05:25,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:25,917 INFO L225 Difference]: With dead ends: 3350 [2025-03-16 19:05:25,918 INFO L226 Difference]: Without dead ends: 2129 [2025-03-16 19:05:25,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:05:25,920 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 77 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:25,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1688 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2025-03-16 19:05:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1751. [2025-03-16 19:05:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1446 states have (on average 1.2503457814661134) internal successors, (1808), 1459 states have internal predecessors, (1808), 201 states have call successors, (201), 92 states have call predecessors, (201), 103 states have return successors, (220), 199 states have call predecessors, (220), 201 states have call successors, (220) [2025-03-16 19:05:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2229 transitions. [2025-03-16 19:05:25,988 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2229 transitions. Word has length 335 [2025-03-16 19:05:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:25,989 INFO L471 AbstractCegarLoop]: Abstraction has 1751 states and 2229 transitions. [2025-03-16 19:05:25,989 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-16 19:05:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2229 transitions. [2025-03-16 19:05:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-16 19:05:25,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:25,992 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, 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-16 19:05:25,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:05:25,992 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:25,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1846565794, now seen corresponding path program 1 times [2025-03-16 19:05:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:25,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814922230] [2025-03-16 19:05:25,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:26,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 19:05:26,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 19:05:26,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:26,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2025-03-16 19:05:26,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:26,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814922230] [2025-03-16 19:05:26,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814922230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:26,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:26,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:26,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490181306] [2025-03-16 19:05:26,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:26,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:26,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:26,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:26,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:26,089 INFO L87 Difference]: Start difference. First operand 1751 states and 2229 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-16 19:05:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:26,194 INFO L93 Difference]: Finished difference Result 3530 states and 4501 transitions. [2025-03-16 19:05:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:26,195 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 335 [2025-03-16 19:05:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:26,201 INFO L225 Difference]: With dead ends: 3530 [2025-03-16 19:05:26,201 INFO L226 Difference]: Without dead ends: 1707 [2025-03-16 19:05:26,204 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-16 19:05:26,204 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 26 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 646 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-16 19:05:26,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 646 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-03-16 19:05:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2025-03-16 19:05:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1413 states have (on average 1.2186836518046709) internal successors, (1722), 1426 states have internal predecessors, (1722), 201 states have call successors, (201), 92 states have call predecessors, (201), 92 states have return successors, (201), 188 states have call predecessors, (201), 201 states have call successors, (201) [2025-03-16 19:05:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2124 transitions. [2025-03-16 19:05:26,269 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2124 transitions. Word has length 335 [2025-03-16 19:05:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:26,270 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2124 transitions. [2025-03-16 19:05:26,270 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-16 19:05:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2124 transitions. [2025-03-16 19:05:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-16 19:05:26,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:26,273 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:26,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:05:26,274 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:26,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1001640950, now seen corresponding path program 1 times [2025-03-16 19:05:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:26,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278609729] [2025-03-16 19:05:26,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:26,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-16 19:05:26,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-16 19:05:26,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:26,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2025-03-16 19:05:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:26,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278609729] [2025-03-16 19:05:26,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278609729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:26,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091474554] [2025-03-16 19:05:26,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:26,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:26,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:26,623 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-16 19:05:26,625 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-16 19:05:26,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-16 19:05:26,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-16 19:05:26,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:26,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:26,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 19:05:26,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 274 proven. 64 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-16 19:05:27,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2025-03-16 19:05:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091474554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:27,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:27,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 12] total 22 [2025-03-16 19:05:27,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345159205] [2025-03-16 19:05:27,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:27,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 19:05:27,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:27,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 19:05:27,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:05:27,867 INFO L87 Difference]: Start difference. First operand 1707 states and 2124 transitions. Second operand has 22 states, 21 states have (on average 12.80952380952381) internal successors, (269), 21 states have internal predecessors, (269), 13 states have call successors, (53), 7 states have call predecessors, (53), 6 states have return successors, (51), 12 states have call predecessors, (51), 12 states have call successors, (51) [2025-03-16 19:05:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:32,430 INFO L93 Difference]: Finished difference Result 16851 states and 22818 transitions. [2025-03-16 19:05:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2025-03-16 19:05:32,430 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 12.80952380952381) internal successors, (269), 21 states have internal predecessors, (269), 13 states have call successors, (53), 7 states have call predecessors, (53), 6 states have return successors, (51), 12 states have call predecessors, (51), 12 states have call successors, (51) Word has length 345 [2025-03-16 19:05:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:32,475 INFO L225 Difference]: With dead ends: 16851 [2025-03-16 19:05:32,475 INFO L226 Difference]: Without dead ends: 15522 [2025-03-16 19:05:32,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12155 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3829, Invalid=26971, Unknown=0, NotChecked=0, Total=30800 [2025-03-16 19:05:32,487 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 5381 mSDsluCounter, 4940 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 1084 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5381 SdHoareTripleChecker+Valid, 5404 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1084 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:32,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5381 Valid, 5404 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1084 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 19:05:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15522 states. [2025-03-16 19:05:32,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15522 to 3227. [2025-03-16 19:05:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 2661 states have (on average 1.2375046974821495) internal successors, (3293), 2687 states have internal predecessors, (3293), 388 states have call successors, (388), 177 states have call predecessors, (388), 177 states have return successors, (388), 362 states have call predecessors, (388), 388 states have call successors, (388) [2025-03-16 19:05:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4069 transitions. [2025-03-16 19:05:32,861 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4069 transitions. Word has length 345 [2025-03-16 19:05:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:32,863 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 4069 transitions. [2025-03-16 19:05:32,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 12.80952380952381) internal successors, (269), 21 states have internal predecessors, (269), 13 states have call successors, (53), 7 states have call predecessors, (53), 6 states have return successors, (51), 12 states have call predecessors, (51), 12 states have call successors, (51) [2025-03-16 19:05:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4069 transitions. [2025-03-16 19:05:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-16 19:05:32,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:32,870 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:32,879 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-16 19:05:33,075 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,SelfDestructingSolverStorable40 [2025-03-16 19:05:33,075 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:33,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash -981303575, now seen corresponding path program 1 times [2025-03-16 19:05:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:33,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394599540] [2025-03-16 19:05:33,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:33,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-16 19:05:33,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-16 19:05:33,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:33,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2025-03-16 19:05:33,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:33,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394599540] [2025-03-16 19:05:33,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394599540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:33,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:33,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:05:33,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769973932] [2025-03-16 19:05:33,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:33,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:05:33,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:33,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:05:33,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:05:33,312 INFO L87 Difference]: Start difference. First operand 3227 states and 4069 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-16 19:05:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:33,683 INFO L93 Difference]: Finished difference Result 6637 states and 8423 transitions. [2025-03-16 19:05:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:05:33,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 345 [2025-03-16 19:05:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:33,696 INFO L225 Difference]: With dead ends: 6637 [2025-03-16 19:05:33,696 INFO L226 Difference]: Without dead ends: 3941 [2025-03-16 19:05:33,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:05:33,701 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 149 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:33,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 2192 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2025-03-16 19:05:33,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3123. [2025-03-16 19:05:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 2587 states have (on average 1.2280633938925396) internal successors, (3177), 2615 states have internal predecessors, (3177), 360 states have call successors, (360), 175 states have call predecessors, (360), 175 states have return successors, (360), 332 states have call predecessors, (360), 360 states have call successors, (360) [2025-03-16 19:05:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 3897 transitions. [2025-03-16 19:05:33,880 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 3897 transitions. Word has length 345 [2025-03-16 19:05:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:33,881 INFO L471 AbstractCegarLoop]: Abstraction has 3123 states and 3897 transitions. [2025-03-16 19:05:33,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-16 19:05:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 3897 transitions. [2025-03-16 19:05:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-16 19:05:33,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:33,886 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:33,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:05:33,887 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:33,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash -284635421, now seen corresponding path program 1 times [2025-03-16 19:05:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812193420] [2025-03-16 19:05:33,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:33,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 19:05:33,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 19:05:33,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:33,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 34 proven. 70 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2025-03-16 19:05:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812193420] [2025-03-16 19:05:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812193420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:34,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934292754] [2025-03-16 19:05:34,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:34,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:34,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:34,806 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-16 19:05:34,807 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-16 19:05:34,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 19:05:35,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 19:05:35,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:35,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:35,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 19:05:35,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 274 proven. 62 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-03-16 19:05:35,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2025-03-16 19:05:36,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934292754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:36,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:36,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 13] total 33 [2025-03-16 19:05:36,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790273486] [2025-03-16 19:05:36,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:36,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 19:05:36,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:36,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 19:05:36,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:05:36,052 INFO L87 Difference]: Start difference. First operand 3123 states and 3897 transitions. Second operand has 33 states, 32 states have (on average 10.375) internal successors, (332), 30 states have internal predecessors, (332), 14 states have call successors, (63), 9 states have call predecessors, (63), 11 states have return successors, (61), 15 states have call predecessors, (61), 13 states have call successors, (61) [2025-03-16 19:06:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:06:26,535 INFO L93 Difference]: Finished difference Result 58675 states and 77231 transitions. [2025-03-16 19:06:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1117 states. [2025-03-16 19:06:26,536 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 10.375) internal successors, (332), 30 states have internal predecessors, (332), 14 states have call successors, (63), 9 states have call predecessors, (63), 11 states have return successors, (61), 15 states have call predecessors, (61), 13 states have call successors, (61) Word has length 346 [2025-03-16 19:06:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:06:26,705 INFO L225 Difference]: With dead ends: 58675 [2025-03-16 19:06:26,705 INFO L226 Difference]: Without dead ends: 56083 [2025-03-16 19:06:26,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1949 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 1145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631147 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=69286, Invalid=1245176, Unknown=0, NotChecked=0, Total=1314462 [2025-03-16 19:06:26,827 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 6994 mSDsluCounter, 14653 mSDsCounter, 0 mSdLazyCounter, 14432 mSolverCounterSat, 1821 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6994 SdHoareTripleChecker+Valid, 15412 SdHoareTripleChecker+Invalid, 16253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1821 IncrementalHoareTripleChecker+Valid, 14432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:06:26,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6994 Valid, 15412 Invalid, 16253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1821 Valid, 14432 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-03-16 19:06:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56083 states.