./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 f34e139d311e566fb184ea47633b96986afa15e7a6ae2ebeede6340c715d2189 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:35:35,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:35:35,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:35:35,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:35:35,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:35:35,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:35:35,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:35:35,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:35:35,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:35:35,871 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:35:35,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:35:35,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:35:35,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:35:35,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:35:35,872 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:35:35,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:35:35,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:35:35,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:35:35,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:35:35,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:35:35,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:35:35,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:35:35,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:35:35,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:35:35,873 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:35:35,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:35:35,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:35:35,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:35:35,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:35:35,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:35:35,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:35:35,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:35:35,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:35:35,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:35:35,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:35:35,875 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:35:35,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:35:35,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:35:35,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:35:35,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:35:35,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:35:35,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:35:35,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:35:35,875 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-jdk21/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 -> f34e139d311e566fb184ea47633b96986afa15e7a6ae2ebeede6340c715d2189 [2025-02-05 17:35:36,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:35:36,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:35:36,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:35:36,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:35:36,103 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:35:36,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c [2025-02-05 17:35:37,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/704343c7f/45c6d2506fec40028c7ecf8f9d8188ac/FLAG413da873b [2025-02-05 17:35:37,773 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:35:37,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c [2025-02-05 17:35:37,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/704343c7f/45c6d2506fec40028c7ecf8f9d8188ac/FLAG413da873b [2025-02-05 17:35:37,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/704343c7f/45c6d2506fec40028c7ecf8f9d8188ac [2025-02-05 17:35:37,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:35:37,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:35:37,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:35:37,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:35:37,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:35:37,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:35:37" (1/1) ... [2025-02-05 17:35:37,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f6dedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:37, skipping insertion in model container [2025-02-05 17:35:37,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:35:37" (1/1) ... [2025-02-05 17:35:37,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:35:38,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c[8653,8666] [2025-02-05 17:35:38,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c[14208,14221] [2025-02-05 17:35:38,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:35:38,854 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:35:38,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c[8653,8666] [2025-02-05 17:35:38,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c[14208,14221] [2025-02-05 17:35:39,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:35:39,164 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:35:39,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39 WrapperNode [2025-02-05 17:35:39,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:35:39,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:35:39,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:35:39,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:35:39,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,417 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5034 [2025-02-05 17:35:39,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:35:39,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:35:39,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:35:39,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:35:39,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,583 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-02-05 17:35:39,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:35:39,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:35:39,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:35:39,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:35:39,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (1/1) ... [2025-02-05 17:35:39,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:35:39,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:39,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:35:39,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:35:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:35:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:35:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:35:39,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:35:39,904 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:35:39,906 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:35:43,368 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5022: havoc calculate_output3_#t~ret36#1; [2025-02-05 17:35:43,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2053: havoc calculate_output_#t~ret34#1; [2025-02-05 17:35:43,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3532: havoc calculate_output2_#t~ret35#1; [2025-02-05 17:35:43,533 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2025-02-05 17:35:43,533 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:35:43,562 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:35:43,564 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:35:43,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:35:43 BoogieIcfgContainer [2025-02-05 17:35:43,564 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:35:43,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:35:43,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:35:43,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:35:43,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:35:37" (1/3) ... [2025-02-05 17:35:43,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f47baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:35:43, skipping insertion in model container [2025-02-05 17:35:43,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:39" (2/3) ... [2025-02-05 17:35:43,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f47baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:35:43, skipping insertion in model container [2025-02-05 17:35:43,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:35:43" (3/3) ... [2025-02-05 17:35:43,572 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c [2025-02-05 17:35:43,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:35:43,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:35:43,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:35:43,663 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;@3c6c974e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:35:43,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:35:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 17:35:43,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:43,677 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] [2025-02-05 17:35:43,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:43,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:43,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1657989458, now seen corresponding path program 1 times [2025-02-05 17:35:43,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:43,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091112049] [2025-02-05 17:35:43,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:43,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:43,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 17:35:43,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 17:35:43,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:43,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:43,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:43,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091112049] [2025-02-05 17:35:43,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091112049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:43,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:43,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:35:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074399710] [2025-02-05 17:35:43,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:43,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:35:43,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:43,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:35:43,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:35:43,879 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:43,934 INFO L93 Difference]: Finished difference Result 1739 states and 3302 transitions. [2025-02-05 17:35:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:35:43,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 17:35:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:43,949 INFO L225 Difference]: With dead ends: 1739 [2025-02-05 17:35:43,949 INFO L226 Difference]: Without dead ends: 819 [2025-02-05 17:35:43,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:35:43,955 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:43,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:43,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-02-05 17:35:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-02-05 17:35:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.894736842105263) internal successors, (1548), 818 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1548 transitions. [2025-02-05 17:35:44,024 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1548 transitions. Word has length 22 [2025-02-05 17:35:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:44,024 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1548 transitions. [2025-02-05 17:35:44,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1548 transitions. [2025-02-05 17:35:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 17:35:44,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:44,026 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] [2025-02-05 17:35:44,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:35:44,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:44,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1147455281, now seen corresponding path program 1 times [2025-02-05 17:35:44,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:44,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316007004] [2025-02-05 17:35:44,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:44,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:44,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 17:35:44,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 17:35:44,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:44,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:44,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:44,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316007004] [2025-02-05 17:35:44,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316007004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:44,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:44,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:44,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304409906] [2025-02-05 17:35:44,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:44,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:44,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:44,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:44,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:44,231 INFO L87 Difference]: Start difference. First operand 819 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:44,330 INFO L93 Difference]: Finished difference Result 895 states and 1666 transitions. [2025-02-05 17:35:44,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:44,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 17:35:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:44,334 INFO L225 Difference]: With dead ends: 895 [2025-02-05 17:35:44,335 INFO L226 Difference]: Without dead ends: 855 [2025-02-05 17:35:44,335 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-02-05 17:35:44,336 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 56 mSDsluCounter, 4603 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:44,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-02-05 17:35:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 819. [2025-02-05 17:35:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.8665850673194615) internal successors, (1525), 818 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1525 transitions. [2025-02-05 17:35:44,361 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1525 transitions. Word has length 22 [2025-02-05 17:35:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:44,361 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1525 transitions. [2025-02-05 17:35:44,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1525 transitions. [2025-02-05 17:35:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:35:44,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:44,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:44,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:35:44,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:44,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:44,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1619243067, now seen corresponding path program 1 times [2025-02-05 17:35:44,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:44,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253864697] [2025-02-05 17:35:44,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:44,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:44,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:35:44,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:35:44,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:44,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:44,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:44,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253864697] [2025-02-05 17:35:44,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253864697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:44,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:44,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:35:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273596321] [2025-02-05 17:35:44,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:44,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:35:44,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:44,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:35:44,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:35:44,537 INFO L87 Difference]: Start difference. First operand 819 states and 1525 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:44,686 INFO L93 Difference]: Finished difference Result 1107 states and 1981 transitions. [2025-02-05 17:35:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:35:44,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-05 17:35:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:44,692 INFO L225 Difference]: With dead ends: 1107 [2025-02-05 17:35:44,692 INFO L226 Difference]: Without dead ends: 1071 [2025-02-05 17:35:44,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:35:44,694 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 6217 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6217 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:44,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6217 Valid, 2309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-02-05 17:35:44,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 853. [2025-02-05 17:35:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8554641598119859) internal successors, (1579), 852 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1579 transitions. [2025-02-05 17:35:44,724 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1579 transitions. Word has length 44 [2025-02-05 17:35:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:44,724 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1579 transitions. [2025-02-05 17:35:44,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1579 transitions. [2025-02-05 17:35:44,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 17:35:44,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:44,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:44,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:35:44,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:44,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1860187818, now seen corresponding path program 1 times [2025-02-05 17:35:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:44,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303904675] [2025-02-05 17:35:44,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:44,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 17:35:44,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 17:35:44,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:44,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:44,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303904675] [2025-02-05 17:35:44,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303904675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:44,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:44,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:44,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168440442] [2025-02-05 17:35:44,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:44,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:44,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:44,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:44,813 INFO L87 Difference]: Start difference. First operand 853 states and 1579 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:44,841 INFO L93 Difference]: Finished difference Result 982 states and 1782 transitions. [2025-02-05 17:35:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:44,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-05 17:35:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:44,845 INFO L225 Difference]: With dead ends: 982 [2025-02-05 17:35:44,845 INFO L226 Difference]: Without dead ends: 912 [2025-02-05 17:35:44,845 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-02-05 17:35:44,846 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:44,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1575 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-02-05 17:35:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-02-05 17:35:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8359030837004404) internal successors, (1667), 909 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-02-05 17:35:44,865 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 46 [2025-02-05 17:35:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:44,866 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-02-05 17:35:44,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-02-05 17:35:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 17:35:44,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:44,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:44,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:35:44,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:44,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1827864583, now seen corresponding path program 1 times [2025-02-05 17:35:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:44,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192798283] [2025-02-05 17:35:44,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:44,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 17:35:44,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 17:35:44,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:44,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:45,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:45,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192798283] [2025-02-05 17:35:45,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192798283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:45,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:45,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:35:45,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420198258] [2025-02-05 17:35:45,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:45,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:35:45,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:45,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:35:45,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:35:45,087 INFO L87 Difference]: Start difference. First operand 910 states and 1667 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:45,205 INFO L93 Difference]: Finished difference Result 1039 states and 1867 transitions. [2025-02-05 17:35:45,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:35:45,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-05 17:35:45,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:45,210 INFO L225 Difference]: With dead ends: 1039 [2025-02-05 17:35:45,210 INFO L226 Difference]: Without dead ends: 912 [2025-02-05 17:35:45,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:35:45,211 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 4446 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4446 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:45,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4446 Valid, 1678 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-02-05 17:35:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-02-05 17:35:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8337004405286343) internal successors, (1665), 909 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1665 transitions. [2025-02-05 17:35:45,235 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1665 transitions. Word has length 46 [2025-02-05 17:35:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:45,235 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1665 transitions. [2025-02-05 17:35:45,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1665 transitions. [2025-02-05 17:35:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 17:35:45,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:45,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:45,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:35:45,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:45,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash -798689491, now seen corresponding path program 1 times [2025-02-05 17:35:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:45,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549697246] [2025-02-05 17:35:45,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:45,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 17:35:45,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 17:35:45,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:45,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:45,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:45,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549697246] [2025-02-05 17:35:45,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549697246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:45,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:45,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976532338] [2025-02-05 17:35:45,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:45,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:45,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:45,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:45,469 INFO L87 Difference]: Start difference. First operand 910 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:45,507 INFO L93 Difference]: Finished difference Result 918 states and 1674 transitions. [2025-02-05 17:35:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:45,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-05 17:35:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:45,511 INFO L225 Difference]: With dead ends: 918 [2025-02-05 17:35:45,511 INFO L226 Difference]: Without dead ends: 916 [2025-02-05 17:35:45,512 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-02-05 17:35:45,513 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:45,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-02-05 17:35:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2025-02-05 17:35:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8271334792122538) internal successors, (1670), 915 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1670 transitions. [2025-02-05 17:35:45,533 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1670 transitions. Word has length 47 [2025-02-05 17:35:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:45,534 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1670 transitions. [2025-02-05 17:35:45,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1670 transitions. [2025-02-05 17:35:45,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 17:35:45,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:45,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:45,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:35:45,536 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:45,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash -799672420, now seen corresponding path program 1 times [2025-02-05 17:35:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:45,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3341186] [2025-02-05 17:35:45,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:45,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:45,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 17:35:45,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 17:35:45,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:45,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3341186] [2025-02-05 17:35:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3341186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886508496] [2025-02-05 17:35:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:45,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:35:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:45,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:35:45,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:35:45,632 INFO L87 Difference]: Start difference. First operand 916 states and 1670 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:51,554 INFO L93 Difference]: Finished difference Result 3171 states and 5979 transitions. [2025-02-05 17:35:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:35:51,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-05 17:35:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:51,561 INFO L225 Difference]: With dead ends: 3171 [2025-02-05 17:35:51,561 INFO L226 Difference]: Without dead ends: 2418 [2025-02-05 17:35:51,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-05 17:35:51,563 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 2389 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:51,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 779 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-02-05 17:35:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2025-02-05 17:35:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2025-02-05 17:35:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5662251655629138) internal successors, (3784), 2417 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3784 transitions. [2025-02-05 17:35:51,596 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3784 transitions. Word has length 48 [2025-02-05 17:35:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:51,597 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3784 transitions. [2025-02-05 17:35:51,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3784 transitions. [2025-02-05 17:35:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 17:35:51,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:51,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:51,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:35:51,598 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash -583055145, now seen corresponding path program 1 times [2025-02-05 17:35:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895162321] [2025-02-05 17:35:51,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:51,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 17:35:51,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 17:35:51,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:51,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:51,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:51,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895162321] [2025-02-05 17:35:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895162321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:51,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885427148] [2025-02-05 17:35:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:51,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:51,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:51,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:51,655 INFO L87 Difference]: Start difference. First operand 2418 states and 3784 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:51,677 INFO L93 Difference]: Finished difference Result 2564 states and 4005 transitions. [2025-02-05 17:35:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:51,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-05 17:35:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:51,685 INFO L225 Difference]: With dead ends: 2564 [2025-02-05 17:35:51,685 INFO L226 Difference]: Without dead ends: 2488 [2025-02-05 17:35:51,686 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-02-05 17:35:51,686 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1486 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:51,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:51,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2025-02-05 17:35:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2486. [2025-02-05 17:35:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2484 states have (on average 1.5640096618357489) internal successors, (3885), 2485 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3885 transitions. [2025-02-05 17:35:51,724 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3885 transitions. Word has length 48 [2025-02-05 17:35:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:51,726 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3885 transitions. [2025-02-05 17:35:51,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3885 transitions. [2025-02-05 17:35:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 17:35:51,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:51,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:51,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:35:51,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:51,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1031000681, now seen corresponding path program 1 times [2025-02-05 17:35:51,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:51,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449263222] [2025-02-05 17:35:51,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:51,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:51,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 17:35:51,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 17:35:51,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:51,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:51,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449263222] [2025-02-05 17:35:51,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449263222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:51,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:51,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510742251] [2025-02-05 17:35:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:51,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:51,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:51,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:51,771 INFO L87 Difference]: Start difference. First operand 2486 states and 3885 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:51,790 INFO L93 Difference]: Finished difference Result 2860 states and 4445 transitions. [2025-02-05 17:35:51,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:51,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-05 17:35:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:51,799 INFO L225 Difference]: With dead ends: 2860 [2025-02-05 17:35:51,799 INFO L226 Difference]: Without dead ends: 2661 [2025-02-05 17:35:51,800 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-02-05 17:35:51,800 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1484 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:51,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-02-05 17:35:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2659. [2025-02-05 17:35:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2659 states, 2657 states have (on average 1.5570191945803538) internal successors, (4137), 2658 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 4137 transitions. [2025-02-05 17:35:51,840 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 4137 transitions. Word has length 48 [2025-02-05 17:35:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:51,840 INFO L471 AbstractCegarLoop]: Abstraction has 2659 states and 4137 transitions. [2025-02-05 17:35:51,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 4137 transitions. [2025-02-05 17:35:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 17:35:51,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:51,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:51,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:35:51,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:51,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash -615824809, now seen corresponding path program 1 times [2025-02-05 17:35:51,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:51,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42690442] [2025-02-05 17:35:51,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:51,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:51,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 17:35:51,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 17:35:51,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:51,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:51,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:51,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42690442] [2025-02-05 17:35:51,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42690442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:51,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:51,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:51,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3714219] [2025-02-05 17:35:51,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:51,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:51,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:51,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:51,881 INFO L87 Difference]: Start difference. First operand 2659 states and 4137 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:51,910 INFO L93 Difference]: Finished difference Result 3355 states and 5159 transitions. [2025-02-05 17:35:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:51,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-05 17:35:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:51,917 INFO L225 Difference]: With dead ends: 3355 [2025-02-05 17:35:51,918 INFO L226 Difference]: Without dead ends: 2983 [2025-02-05 17:35:51,919 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-02-05 17:35:51,919 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1482 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:51,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1633 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-02-05 17:35:51,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2981. [2025-02-05 17:35:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2981 states, 2979 states have (on average 1.541792547834844) internal successors, (4593), 2980 states have internal predecessors, (4593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 4593 transitions. [2025-02-05 17:35:51,961 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 4593 transitions. Word has length 48 [2025-02-05 17:35:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:51,961 INFO L471 AbstractCegarLoop]: Abstraction has 2981 states and 4593 transitions. [2025-02-05 17:35:51,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 4593 transitions. [2025-02-05 17:35:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 17:35:51,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:51,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:51,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:35:51,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:51,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:51,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1102543081, now seen corresponding path program 1 times [2025-02-05 17:35:51,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:51,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219593919] [2025-02-05 17:35:51,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:51,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:51,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 17:35:51,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 17:35:51,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:51,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:51,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:51,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219593919] [2025-02-05 17:35:51,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219593919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:51,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969117065] [2025-02-05 17:35:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:51,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:51,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:51,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:51,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:51,995 INFO L87 Difference]: Start difference. First operand 2981 states and 4593 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:52,022 INFO L93 Difference]: Finished difference Result 4273 states and 6443 transitions. [2025-02-05 17:35:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:52,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-05 17:35:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:52,032 INFO L225 Difference]: With dead ends: 4273 [2025-02-05 17:35:52,032 INFO L226 Difference]: Without dead ends: 3579 [2025-02-05 17:35:52,035 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-02-05 17:35:52,035 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1480 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:52,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1635 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2025-02-05 17:35:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 3577. [2025-02-05 17:35:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3575 states have (on average 1.513006993006993) internal successors, (5409), 3576 states have internal predecessors, (5409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 5409 transitions. [2025-02-05 17:35:52,096 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 5409 transitions. Word has length 48 [2025-02-05 17:35:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:52,096 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 5409 transitions. [2025-02-05 17:35:52,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 5409 transitions. [2025-02-05 17:35:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:35:52,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:52,097 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:52,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:35:52,098 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:52,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:52,098 INFO L85 PathProgramCache]: Analyzing trace with hash -492453955, now seen corresponding path program 1 times [2025-02-05 17:35:52,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:52,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483757336] [2025-02-05 17:35:52,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:52,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:52,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:35:52,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:35:52,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:52,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:35:52,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:52,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483757336] [2025-02-05 17:35:52,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483757336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:52,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:52,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:35:52,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467091233] [2025-02-05 17:35:52,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:52,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:35:52,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:52,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:35:52,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:35:52,210 INFO L87 Difference]: Start difference. First operand 3577 states and 5409 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:52,398 INFO L93 Difference]: Finished difference Result 8667 states and 12598 transitions. [2025-02-05 17:35:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:35:52,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 17:35:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:52,427 INFO L225 Difference]: With dead ends: 8667 [2025-02-05 17:35:52,427 INFO L226 Difference]: Without dead ends: 7737 [2025-02-05 17:35:52,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:35:52,431 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4645 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4645 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:52,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4645 Valid, 3389 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2025-02-05 17:35:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 4689. [2025-02-05 17:35:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4687 states have (on average 1.4851717516535097) internal successors, (6961), 4688 states have internal predecessors, (6961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 6961 transitions. [2025-02-05 17:35:52,543 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 6961 transitions. Word has length 65 [2025-02-05 17:35:52,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:52,544 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 6961 transitions. [2025-02-05 17:35:52,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 6961 transitions. [2025-02-05 17:35:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:35:52,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:52,548 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:52,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:35:52,548 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:52,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash -940399491, now seen corresponding path program 1 times [2025-02-05 17:35:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:52,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270495064] [2025-02-05 17:35:52,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:52,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:35:52,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:35:52,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:52,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:35:52,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270495064] [2025-02-05 17:35:52,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270495064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:52,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:52,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:35:52,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962811929] [2025-02-05 17:35:52,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:52,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:35:52,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:52,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:35:52,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:35:52,649 INFO L87 Difference]: Start difference. First operand 4689 states and 6961 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:52,816 INFO L93 Difference]: Finished difference Result 9955 states and 14406 transitions. [2025-02-05 17:35:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:35:52,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 17:35:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:52,835 INFO L225 Difference]: With dead ends: 9955 [2025-02-05 17:35:52,836 INFO L226 Difference]: Without dead ends: 8665 [2025-02-05 17:35:52,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:35:52,841 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4647 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:52,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 3366 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8665 states. [2025-02-05 17:35:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8665 to 6441. [2025-02-05 17:35:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6441 states, 6439 states have (on average 1.4600093182171145) internal successors, (9401), 6440 states have internal predecessors, (9401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 9401 transitions. [2025-02-05 17:35:52,965 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 9401 transitions. Word has length 65 [2025-02-05 17:35:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:52,966 INFO L471 AbstractCegarLoop]: Abstraction has 6441 states and 9401 transitions. [2025-02-05 17:35:52,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 9401 transitions. [2025-02-05 17:35:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:35:52,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:52,968 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:52,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:35:52,968 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:52,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash -525223619, now seen corresponding path program 1 times [2025-02-05 17:35:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919305514] [2025-02-05 17:35:52,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:52,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:35:52,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:35:52,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:52,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:35:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919305514] [2025-02-05 17:35:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919305514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:53,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:35:53,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921674473] [2025-02-05 17:35:53,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:35:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:53,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:35:53,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:35:53,059 INFO L87 Difference]: Start difference. First operand 6441 states and 9401 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:53,225 INFO L93 Difference]: Finished difference Result 11243 states and 16206 transitions. [2025-02-05 17:35:53,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:35:53,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 17:35:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:53,245 INFO L225 Difference]: With dead ends: 11243 [2025-02-05 17:35:53,246 INFO L226 Difference]: Without dead ends: 9953 [2025-02-05 17:35:53,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:35:53,251 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 4669 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:53,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 3349 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9953 states. [2025-02-05 17:35:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9953 to 7729. [2025-02-05 17:35:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7729 states, 7727 states have (on average 1.4495923385531253) internal successors, (11201), 7728 states have internal predecessors, (11201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 11201 transitions. [2025-02-05 17:35:53,453 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 11201 transitions. Word has length 65 [2025-02-05 17:35:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:53,453 INFO L471 AbstractCegarLoop]: Abstraction has 7729 states and 11201 transitions. [2025-02-05 17:35:53,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 11201 transitions. [2025-02-05 17:35:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:35:53,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:53,455 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:53,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:35:53,456 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:53,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1011941891, now seen corresponding path program 1 times [2025-02-05 17:35:53,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:53,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619055815] [2025-02-05 17:35:53,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:53,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:53,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:35:53,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:35:53,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:53,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:35:53,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619055815] [2025-02-05 17:35:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619055815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:53,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:53,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:35:53,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853474401] [2025-02-05 17:35:53,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:53,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:35:53,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:53,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:35:53,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:35:53,537 INFO L87 Difference]: Start difference. First operand 7729 states and 11201 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:53,706 INFO L93 Difference]: Finished difference Result 12531 states and 18006 transitions. [2025-02-05 17:35:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:35:53,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 17:35:53,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:53,722 INFO L225 Difference]: With dead ends: 12531 [2025-02-05 17:35:53,723 INFO L226 Difference]: Without dead ends: 11241 [2025-02-05 17:35:53,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:35:53,727 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 4659 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4659 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:53,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4659 Valid, 3367 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11241 states. [2025-02-05 17:35:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11241 to 9017. [2025-02-05 17:35:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4421519689406546) internal successors, (13001), 9016 states have internal predecessors, (13001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 13001 transitions. [2025-02-05 17:35:53,874 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 13001 transitions. Word has length 65 [2025-02-05 17:35:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:53,874 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 13001 transitions. [2025-02-05 17:35:53,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 13001 transitions. [2025-02-05 17:35:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:35:53,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:53,876 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:53,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:35:53,876 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:53,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash 78192369, now seen corresponding path program 1 times [2025-02-05 17:35:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:53,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677209277] [2025-02-05 17:35:53,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:53,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:35:53,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:35:53,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:53,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:53,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:53,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677209277] [2025-02-05 17:35:53,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677209277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:53,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:53,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:53,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168012908] [2025-02-05 17:35:53,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:53,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:53,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:53,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:53,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:53,939 INFO L87 Difference]: Start difference. First operand 9017 states and 13001 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:54,104 INFO L93 Difference]: Finished difference Result 15749 states and 22419 transitions. [2025-02-05 17:35:54,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:54,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 17:35:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:54,118 INFO L225 Difference]: With dead ends: 15749 [2025-02-05 17:35:54,119 INFO L226 Difference]: Without dead ends: 9019 [2025-02-05 17:35:54,127 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-02-05 17:35:54,127 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 37 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3064 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-02-05 17:35:54,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3064 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:54,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9019 states. [2025-02-05 17:35:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9019 to 9017. [2025-02-05 17:35:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4283971159179145) internal successors, (12877), 9016 states have internal predecessors, (12877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 12877 transitions. [2025-02-05 17:35:54,346 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 12877 transitions. Word has length 66 [2025-02-05 17:35:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:54,347 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 12877 transitions. [2025-02-05 17:35:54,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 12877 transitions. [2025-02-05 17:35:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:35:54,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:54,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:54,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:35:54,349 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:54,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash -628102213, now seen corresponding path program 1 times [2025-02-05 17:35:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:54,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470028450] [2025-02-05 17:35:54,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:54,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:54,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:35:54,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:35:54,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:54,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:54,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470028450] [2025-02-05 17:35:54,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470028450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:54,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:54,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619769339] [2025-02-05 17:35:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:54,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:54,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:54,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:54,439 INFO L87 Difference]: Start difference. First operand 9017 states and 12877 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:54,514 INFO L93 Difference]: Finished difference Result 11590 states and 16461 transitions. [2025-02-05 17:35:54,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:54,515 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 17:35:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:54,525 INFO L225 Difference]: With dead ends: 11590 [2025-02-05 17:35:54,525 INFO L226 Difference]: Without dead ends: 4860 [2025-02-05 17:35:54,531 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-02-05 17:35:54,532 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 31 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3061 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-02-05 17:35:54,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3061 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2025-02-05 17:35:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4852. [2025-02-05 17:35:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4850 states have (on average 1.4672164948453608) internal successors, (7116), 4851 states have internal predecessors, (7116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 7116 transitions. [2025-02-05 17:35:54,610 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 7116 transitions. Word has length 67 [2025-02-05 17:35:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:54,610 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 7116 transitions. [2025-02-05 17:35:54,611 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 7116 transitions. [2025-02-05 17:35:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:35:54,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:54,612 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:54,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:35:54,612 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:54,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:54,612 INFO L85 PathProgramCache]: Analyzing trace with hash 667894008, now seen corresponding path program 1 times [2025-02-05 17:35:54,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:54,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429162057] [2025-02-05 17:35:54,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:54,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:54,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:35:54,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:35:54,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:54,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429162057] [2025-02-05 17:35:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429162057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:54,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:54,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:54,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608807705] [2025-02-05 17:35:54,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:54,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:54,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:54,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:54,668 INFO L87 Difference]: Start difference. First operand 4852 states and 7116 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:54,698 INFO L93 Difference]: Finished difference Result 6132 states and 8878 transitions. [2025-02-05 17:35:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:54,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 17:35:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:54,704 INFO L225 Difference]: With dead ends: 6132 [2025-02-05 17:35:54,704 INFO L226 Difference]: Without dead ends: 3578 [2025-02-05 17:35:54,706 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-02-05 17:35:54,707 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 33 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3040 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-02-05 17:35:54,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3040 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2025-02-05 17:35:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3576. [2025-02-05 17:35:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3574 states have (on average 1.4924454392837156) internal successors, (5334), 3575 states have internal predecessors, (5334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 5334 transitions. [2025-02-05 17:35:54,741 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 5334 transitions. Word has length 68 [2025-02-05 17:35:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:54,742 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 5334 transitions. [2025-02-05 17:35:54,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 5334 transitions. [2025-02-05 17:35:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 17:35:54,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:54,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:54,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:35:54,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:54,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:54,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1675746273, now seen corresponding path program 1 times [2025-02-05 17:35:54,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:54,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716577977] [2025-02-05 17:35:54,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:54,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:54,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 17:35:54,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 17:35:54,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:54,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:54,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:54,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716577977] [2025-02-05 17:35:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716577977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:54,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:54,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:54,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390485053] [2025-02-05 17:35:54,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:54,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:54,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:54,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:54,801 INFO L87 Difference]: Start difference. First operand 3576 states and 5334 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:54,825 INFO L93 Difference]: Finished difference Result 4218 states and 6205 transitions. [2025-02-05 17:35:54,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:54,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 17:35:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:54,829 INFO L225 Difference]: With dead ends: 4218 [2025-02-05 17:35:54,830 INFO L226 Difference]: Without dead ends: 2940 [2025-02-05 17:35:54,831 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-02-05 17:35:54,831 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 30 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3025 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-02-05 17:35:54,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-02-05 17:35:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2025-02-05 17:35:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.5170299727520435) internal successors, (4454), 2937 states have internal predecessors, (4454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4454 transitions. [2025-02-05 17:35:54,856 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4454 transitions. Word has length 70 [2025-02-05 17:35:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:54,857 INFO L471 AbstractCegarLoop]: Abstraction has 2938 states and 4454 transitions. [2025-02-05 17:35:54,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4454 transitions. [2025-02-05 17:35:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 17:35:54,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:54,858 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:54,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:35:54,858 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:54,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash 642136166, now seen corresponding path program 1 times [2025-02-05 17:35:54,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:54,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179201872] [2025-02-05 17:35:54,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:54,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 17:35:54,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 17:35:54,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:54,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:55,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:55,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179201872] [2025-02-05 17:35:55,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179201872] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:55,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585715117] [2025-02-05 17:35:55,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:55,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:55,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:55,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:35:55,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:35:55,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 17:35:55,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 17:35:55,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:55,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:55,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 17:35:55,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:55,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:55,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585715117] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:55,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2025-02-05 17:35:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688510913] [2025-02-05 17:35:55,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:55,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 17:35:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:55,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 17:35:55,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-02-05 17:35:55,764 INFO L87 Difference]: Start difference. First operand 2938 states and 4454 transitions. Second operand has 19 states, 19 states have (on average 10.68421052631579) internal successors, (203), 19 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:57,328 INFO L93 Difference]: Finished difference Result 8007 states and 11091 transitions. [2025-02-05 17:35:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-05 17:35:57,329 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.68421052631579) internal successors, (203), 19 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 17:35:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:57,339 INFO L225 Difference]: With dead ends: 8007 [2025-02-05 17:35:57,339 INFO L226 Difference]: Without dead ends: 7293 [2025-02-05 17:35:57,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=804, Invalid=3486, Unknown=0, NotChecked=0, Total=4290 [2025-02-05 17:35:57,343 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 10151 mSDsluCounter, 9364 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10151 SdHoareTripleChecker+Valid, 10897 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:57,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10151 Valid, 10897 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:35:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7293 states. [2025-02-05 17:35:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7293 to 6705. [2025-02-05 17:35:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6705 states, 6703 states have (on average 1.3875876473220945) internal successors, (9301), 6704 states have internal predecessors, (9301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 9301 transitions. [2025-02-05 17:35:57,458 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 9301 transitions. Word has length 72 [2025-02-05 17:35:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:57,459 INFO L471 AbstractCegarLoop]: Abstraction has 6705 states and 9301 transitions. [2025-02-05 17:35:57,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.68421052631579) internal successors, (203), 19 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 9301 transitions. [2025-02-05 17:35:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 17:35:57,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:57,460 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:57,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:35:57,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:57,661 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:57,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash 542316651, now seen corresponding path program 1 times [2025-02-05 17:35:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:57,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428510032] [2025-02-05 17:35:57,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:57,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:57,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 17:35:57,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 17:35:57,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:57,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428510032] [2025-02-05 17:35:57,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428510032] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067501609] [2025-02-05 17:35:57,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:57,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:57,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:35:57,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:35:57,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 17:35:58,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 17:35:58,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:58,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:58,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 17:35:58,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:58,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:59,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067501609] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:59,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:59,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-05 17:35:59,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724222504] [2025-02-05 17:35:59,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:59,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 17:35:59,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:59,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 17:35:59,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-02-05 17:35:59,010 INFO L87 Difference]: Start difference. First operand 6705 states and 9301 transitions. Second operand has 23 states, 23 states have (on average 7.608695652173913) internal successors, (175), 22 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:59,498 INFO L93 Difference]: Finished difference Result 15617 states and 20904 transitions. [2025-02-05 17:35:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 17:35:59,498 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.608695652173913) internal successors, (175), 22 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 17:35:59,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:59,513 INFO L225 Difference]: With dead ends: 15617 [2025-02-05 17:35:59,513 INFO L226 Difference]: Without dead ends: 11505 [2025-02-05 17:35:59,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 17:35:59,520 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 10722 mSDsluCounter, 4611 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10722 SdHoareTripleChecker+Valid, 6109 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:59,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10722 Valid, 6109 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:35:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11505 states. [2025-02-05 17:35:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11505 to 11353. [2025-02-05 17:35:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11353 states, 11351 states have (on average 1.3341555810060788) internal successors, (15144), 11352 states have internal predecessors, (15144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11353 states to 11353 states and 15144 transitions. [2025-02-05 17:35:59,741 INFO L78 Accepts]: Start accepts. Automaton has 11353 states and 15144 transitions. Word has length 73 [2025-02-05 17:35:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:59,742 INFO L471 AbstractCegarLoop]: Abstraction has 11353 states and 15144 transitions. [2025-02-05 17:35:59,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.608695652173913) internal successors, (175), 22 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 11353 states and 15144 transitions. [2025-02-05 17:35:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 17:35:59,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:59,744 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:59,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 17:35:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:59,948 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:59,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:59,948 INFO L85 PathProgramCache]: Analyzing trace with hash -893248341, now seen corresponding path program 1 times [2025-02-05 17:35:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:59,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646259102] [2025-02-05 17:35:59,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:59,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 17:35:59,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 17:35:59,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:59,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:00,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:36:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646259102] [2025-02-05 17:36:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646259102] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:36:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856065089] [2025-02-05 17:36:00,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:00,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:00,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:36:00,662 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:36:00,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:36:00,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 17:36:00,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 17:36:00,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:00,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:00,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:36:00,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:36:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:01,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:36:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:01,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856065089] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:36:01,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:36:01,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-02-05 17:36:01,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448978020] [2025-02-05 17:36:01,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:36:01,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 17:36:01,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:36:01,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 17:36:01,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-02-05 17:36:01,569 INFO L87 Difference]: Start difference. First operand 11353 states and 15144 transitions. Second operand has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:36:02,363 INFO L93 Difference]: Finished difference Result 29799 states and 38839 transitions. [2025-02-05 17:36:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 17:36:02,364 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 17:36:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:36:02,386 INFO L225 Difference]: With dead ends: 29799 [2025-02-05 17:36:02,387 INFO L226 Difference]: Without dead ends: 21195 [2025-02-05 17:36:02,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 17:36:02,395 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 18137 mSDsluCounter, 6216 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18137 SdHoareTripleChecker+Valid, 7714 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:36:02,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18137 Valid, 7714 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:36:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21195 states. [2025-02-05 17:36:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21195 to 20911. [2025-02-05 17:36:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20911 states, 20909 states have (on average 1.2925056195896505) internal successors, (27025), 20910 states have internal predecessors, (27025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 27025 transitions. [2025-02-05 17:36:02,905 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 27025 transitions. Word has length 73 [2025-02-05 17:36:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:36:02,905 INFO L471 AbstractCegarLoop]: Abstraction has 20911 states and 27025 transitions. [2025-02-05 17:36:02,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 27025 transitions. [2025-02-05 17:36:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 17:36:02,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:36:02,907 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:36:02,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 17:36:03,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:03,110 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:36:03,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:36:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1204747137, now seen corresponding path program 1 times [2025-02-05 17:36:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:36:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947876410] [2025-02-05 17:36:03,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:03,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:36:03,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 17:36:03,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 17:36:03,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:03,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:03,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:36:03,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947876410] [2025-02-05 17:36:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947876410] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:36:03,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047445583] [2025-02-05 17:36:03,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:03,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:03,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:36:03,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:36:03,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:36:03,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 17:36:03,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 17:36:03,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:03,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:03,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 17:36:03,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:36:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:06,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:36:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047445583] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:36:08,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:36:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 20] total 44 [2025-02-05 17:36:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011331540] [2025-02-05 17:36:08,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:36:08,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-05 17:36:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:36:08,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-05 17:36:08,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 17:36:08,482 INFO L87 Difference]: Start difference. First operand 20911 states and 27025 transitions. Second operand has 44 states, 44 states have (on average 4.318181818181818) internal successors, (190), 44 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:36:26,174 INFO L93 Difference]: Finished difference Result 90637 states and 115345 transitions. [2025-02-05 17:36:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2025-02-05 17:36:26,175 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.318181818181818) internal successors, (190), 44 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-02-05 17:36:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:36:26,364 INFO L225 Difference]: With dead ends: 90637 [2025-02-05 17:36:26,365 INFO L226 Difference]: Without dead ends: 72843 [2025-02-05 17:36:26,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15354 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=7208, Invalid=31404, Unknown=0, NotChecked=0, Total=38612 [2025-02-05 17:36:26,417 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 17386 mSDsluCounter, 15959 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17386 SdHoareTripleChecker+Valid, 17561 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:36:26,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17386 Valid, 17561 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2934 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 17:36:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72843 states. [2025-02-05 17:36:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72843 to 40959. [2025-02-05 17:36:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40959 states, 40957 states have (on average 1.2726762214029348) internal successors, (52125), 40958 states have internal predecessors, (52125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40959 states to 40959 states and 52125 transitions. [2025-02-05 17:36:28,110 INFO L78 Accepts]: Start accepts. Automaton has 40959 states and 52125 transitions. Word has length 74 [2025-02-05 17:36:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:36:28,110 INFO L471 AbstractCegarLoop]: Abstraction has 40959 states and 52125 transitions. [2025-02-05 17:36:28,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.318181818181818) internal successors, (190), 44 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 40959 states and 52125 transitions. [2025-02-05 17:36:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 17:36:28,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:36:28,115 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:36:28,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 17:36:28,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-05 17:36:28,319 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:36:28,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:36:28,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1881637423, now seen corresponding path program 1 times [2025-02-05 17:36:28,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:36:28,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472368759] [2025-02-05 17:36:28,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:36:28,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 17:36:28,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 17:36:28,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:28,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:30,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:36:30,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472368759] [2025-02-05 17:36:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472368759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:36:30,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887101612] [2025-02-05 17:36:30,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:30,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:30,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:36:30,189 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:36:30,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:36:30,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 17:36:30,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 17:36:30,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:30,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:30,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-05 17:36:30,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:36:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:33,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:36:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:35,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887101612] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:36:35,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:36:35,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 23] total 61 [2025-02-05 17:36:35,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475445949] [2025-02-05 17:36:35,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:36:35,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-02-05 17:36:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:36:35,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-02-05 17:36:35,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=3331, Unknown=0, NotChecked=0, Total=3660 [2025-02-05 17:36:35,799 INFO L87 Difference]: Start difference. First operand 40959 states and 52125 transitions. Second operand has 61 states, 61 states have (on average 3.2295081967213113) internal successors, (197), 61 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)