./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/hardness-nfm22/hardness_operatoramount_amount500_file-50.i -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 06ef7f2efa2a7691ecaef299a937b3a52b6ee19dfe067204bd3fd1b2386eabbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:47:38,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:47:38,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:47:38,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:47:38,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:47:38,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:47:38,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:47:38,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:47:38,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:47:38,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:47:38,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:47:38,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:47:38,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:47:38,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:47:38,987 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:47:38,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:47:38,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:47:38,987 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:47:38,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:47:38,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:47:38,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:47:38,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:47:38,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:47:38,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:47:38,988 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:47:38,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:47:38,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:47:38,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:47:38,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:47:38,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:38,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:38,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:38,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:38,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:38,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:47:38,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:47:38,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:47:38,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:47:38,990 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 -> 06ef7f2efa2a7691ecaef299a937b3a52b6ee19dfe067204bd3fd1b2386eabbe [2025-01-09 14:47:39,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:47:39,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:47:39,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:47:39,216 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:47:39,216 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:47:39,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-50.i [2025-01-09 14:47:40,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/651d45050/0543c6d497e44ec887b14467545fa942/FLAGc8620588a [2025-01-09 14:47:40,714 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:47:40,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-50.i [2025-01-09 14:47:40,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/651d45050/0543c6d497e44ec887b14467545fa942/FLAGc8620588a [2025-01-09 14:47:40,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/651d45050/0543c6d497e44ec887b14467545fa942 [2025-01-09 14:47:40,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:47:40,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:47:40,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:40,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:47:40,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:47:40,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:40" (1/1) ... [2025-01-09 14:47:40,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b785a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:40, skipping insertion in model container [2025-01-09 14:47:40,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:40" (1/1) ... [2025-01-09 14:47:40,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:47:40,869 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/hardness-nfm22/hardness_operatoramount_amount500_file-50.i[916,929] [2025-01-09 14:47:41,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:41,012 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:47:41,022 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/hardness-nfm22/hardness_operatoramount_amount500_file-50.i[916,929] [2025-01-09 14:47:41,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:41,115 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:47:41,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41 WrapperNode [2025-01-09 14:47:41,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:41,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:41,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:47:41,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:47:41,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,241 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 709 [2025-01-09 14:47:41,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:41,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:47:41,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:47:41,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:47:41,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,334 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-01-09 14:47:41,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:47:41,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:47:41,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:47:41,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:47:41,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (1/1) ... [2025-01-09 14:47:41,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:41,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:41,414 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-01-09 14:47:41,447 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-01-09 14:47:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:47:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:47:41,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:47:41,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:47:41,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:47:41,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:47:41,580 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:47:41,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:47:42,595 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-01-09 14:47:42,596 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:47:42,605 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:47:42,605 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:47:42,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:42 BoogieIcfgContainer [2025-01-09 14:47:42,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:47:42,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:47:42,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:47:42,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:47:42,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:40" (1/3) ... [2025-01-09 14:47:42,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1d7c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:42, skipping insertion in model container [2025-01-09 14:47:42,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:41" (2/3) ... [2025-01-09 14:47:42,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1d7c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:42, skipping insertion in model container [2025-01-09 14:47:42,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:42" (3/3) ... [2025-01-09 14:47:42,613 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-50.i [2025-01-09 14:47:42,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:47:42,625 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-50.i that has 2 procedures, 278 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:47:42,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:47:42,676 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;@27a7fb11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:47:42,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:47:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 278 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 209 states have internal predecessors, (317), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 14:47:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-01-09 14:47:42,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:42,698 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:42,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:42,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:42,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1461024752, now seen corresponding path program 1 times [2025-01-09 14:47:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243758062] [2025-01-09 14:47:42,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:42,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:42,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-01-09 14:47:42,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-01-09 14:47:42,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:42,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 14:47:43,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:43,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243758062] [2025-01-09 14:47:43,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243758062] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596014173] [2025-01-09 14:47:43,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:43,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:43,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:43,224 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-01-09 14:47:43,226 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-01-09 14:47:43,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-01-09 14:47:43,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-01-09 14:47:43,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:43,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:43,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:47:43,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 14:47:43,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:47:43,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596014173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:43,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:47:43,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:47:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406638136] [2025-01-09 14:47:43,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:43,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:47:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:43,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:47:43,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:43,609 INFO L87 Difference]: Start difference. First operand has 278 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 209 states have internal predecessors, (317), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:47:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:43,656 INFO L93 Difference]: Finished difference Result 548 states and 962 transitions. [2025-01-09 14:47:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:47:43,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 474 [2025-01-09 14:47:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:43,664 INFO L225 Difference]: With dead ends: 548 [2025-01-09 14:47:43,664 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 14:47:43,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 475 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-01-09 14:47:43,670 INFO L435 NwaCegarLoop]: 441 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, 441 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-01-09 14:47:43,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 14:47:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-01-09 14:47:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 204 states have (on average 1.5049019607843137) internal successors, (307), 204 states have internal predecessors, (307), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 14:47:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 441 transitions. [2025-01-09 14:47:43,726 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 441 transitions. Word has length 474 [2025-01-09 14:47:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:43,726 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 441 transitions. [2025-01-09 14:47:43,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:47:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 441 transitions. [2025-01-09 14:47:43,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-01-09 14:47:43,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:43,735 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:43,746 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-01-09 14:47:43,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:47:43,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:43,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash -75615446, now seen corresponding path program 1 times [2025-01-09 14:47:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:43,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540693840] [2025-01-09 14:47:43,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:43,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:43,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-01-09 14:47:44,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-01-09 14:47:44,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:44,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:44,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:44,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540693840] [2025-01-09 14:47:44,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540693840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:44,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:44,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743297465] [2025-01-09 14:47:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:44,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:44,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:44,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:44,462 INFO L87 Difference]: Start difference. First operand 273 states and 441 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:44,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:44,542 INFO L93 Difference]: Finished difference Result 729 states and 1176 transitions. [2025-01-09 14:47:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:44,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 474 [2025-01-09 14:47:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:44,546 INFO L225 Difference]: With dead ends: 729 [2025-01-09 14:47:44,546 INFO L226 Difference]: Without dead ends: 459 [2025-01-09 14:47:44,547 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-01-09 14:47:44,548 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 287 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:44,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1117 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-09 14:47:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 456. [2025-01-09 14:47:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 355 states have (on average 1.5126760563380282) internal successors, (537), 356 states have internal predecessors, (537), 98 states have call successors, (98), 2 states have call predecessors, (98), 2 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 14:47:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 733 transitions. [2025-01-09 14:47:44,581 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 733 transitions. Word has length 474 [2025-01-09 14:47:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:44,582 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 733 transitions. [2025-01-09 14:47:44,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 733 transitions. [2025-01-09 14:47:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-01-09 14:47:44,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:44,591 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:44,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:47:44,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:44,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1005652244, now seen corresponding path program 1 times [2025-01-09 14:47:44,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:44,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820630768] [2025-01-09 14:47:44,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:44,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:44,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-01-09 14:47:44,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-01-09 14:47:44,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:44,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:45,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:45,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820630768] [2025-01-09 14:47:45,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820630768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:45,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:45,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:45,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27229836] [2025-01-09 14:47:45,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:45,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:45,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:45,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:45,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:45,024 INFO L87 Difference]: Start difference. First operand 456 states and 733 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:45,105 INFO L93 Difference]: Finished difference Result 1356 states and 2181 transitions. [2025-01-09 14:47:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:45,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 474 [2025-01-09 14:47:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:45,115 INFO L225 Difference]: With dead ends: 1356 [2025-01-09 14:47:45,116 INFO L226 Difference]: Without dead ends: 903 [2025-01-09 14:47:45,117 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-01-09 14:47:45,117 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 431 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:45,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 852 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-01-09 14:47:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 516. [2025-01-09 14:47:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 415 states have (on average 1.5397590361445783) internal successors, (639), 416 states have internal predecessors, (639), 98 states have call successors, (98), 2 states have call predecessors, (98), 2 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 14:47:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 835 transitions. [2025-01-09 14:47:45,167 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 835 transitions. Word has length 474 [2025-01-09 14:47:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:45,168 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 835 transitions. [2025-01-09 14:47:45,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 835 transitions. [2025-01-09 14:47:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-01-09 14:47:45,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:45,173 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:45,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:47:45,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:45,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash -964977494, now seen corresponding path program 1 times [2025-01-09 14:47:45,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:45,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017718023] [2025-01-09 14:47:45,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:45,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:45,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-01-09 14:47:45,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-01-09 14:47:45,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:45,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017718023] [2025-01-09 14:47:45,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017718023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:45,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:45,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:45,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265908672] [2025-01-09 14:47:45,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:45,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:45,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:45,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:45,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:45,454 INFO L87 Difference]: Start difference. First operand 516 states and 835 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:45,583 INFO L93 Difference]: Finished difference Result 1540 states and 2495 transitions. [2025-01-09 14:47:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:45,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 474 [2025-01-09 14:47:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:45,592 INFO L225 Difference]: With dead ends: 1540 [2025-01-09 14:47:45,592 INFO L226 Difference]: Without dead ends: 1027 [2025-01-09 14:47:45,596 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-01-09 14:47:45,597 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 408 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:45,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1220 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-01-09 14:47:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1021. [2025-01-09 14:47:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 820 states have (on average 1.5219512195121951) internal successors, (1248), 822 states have internal predecessors, (1248), 196 states have call successors, (196), 4 states have call predecessors, (196), 4 states have return successors, (196), 194 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 14:47:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1640 transitions. [2025-01-09 14:47:45,702 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1640 transitions. Word has length 474 [2025-01-09 14:47:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:45,704 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1640 transitions. [2025-01-09 14:47:45,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1640 transitions. [2025-01-09 14:47:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-01-09 14:47:45,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:45,714 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:47:45,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:45,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1397831274, now seen corresponding path program 1 times [2025-01-09 14:47:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:45,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202221009] [2025-01-09 14:47:45,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:45,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-01-09 14:47:45,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-01-09 14:47:45,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:45,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:45,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202221009] [2025-01-09 14:47:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202221009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:45,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187723806] [2025-01-09 14:47:45,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:45,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:45,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:45,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:45,959 INFO L87 Difference]: Start difference. First operand 1021 states and 1640 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:46,106 INFO L93 Difference]: Finished difference Result 3057 states and 4914 transitions. [2025-01-09 14:47:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:46,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 474 [2025-01-09 14:47:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:46,118 INFO L225 Difference]: With dead ends: 3057 [2025-01-09 14:47:46,118 INFO L226 Difference]: Without dead ends: 2039 [2025-01-09 14:47:46,122 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-01-09 14:47:46,123 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 431 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:46,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 862 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2025-01-09 14:47:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2021. [2025-01-09 14:47:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 1620 states have (on average 1.5160493827160493) internal successors, (2456), 1624 states have internal predecessors, (2456), 392 states have call successors, (392), 8 states have call predecessors, (392), 8 states have return successors, (392), 388 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 14:47:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 3240 transitions. [2025-01-09 14:47:46,266 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 3240 transitions. Word has length 474 [2025-01-09 14:47:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:46,266 INFO L471 AbstractCegarLoop]: Abstraction has 2021 states and 3240 transitions. [2025-01-09 14:47:46,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 3240 transitions. [2025-01-09 14:47:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-01-09 14:47:46,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:46,274 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:46,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:47:46,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:46,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1538379884, now seen corresponding path program 1 times [2025-01-09 14:47:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048247332] [2025-01-09 14:47:46,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:46,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-01-09 14:47:46,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-01-09 14:47:46,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:46,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:46,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:46,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048247332] [2025-01-09 14:47:46,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048247332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:46,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:46,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:46,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394014630] [2025-01-09 14:47:46,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:46,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:46,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:46,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:46,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:46,514 INFO L87 Difference]: Start difference. First operand 2021 states and 3240 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:46,678 INFO L93 Difference]: Finished difference Result 6025 states and 9650 transitions. [2025-01-09 14:47:46,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:46,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 474 [2025-01-09 14:47:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:46,695 INFO L225 Difference]: With dead ends: 6025 [2025-01-09 14:47:46,696 INFO L226 Difference]: Without dead ends: 4007 [2025-01-09 14:47:46,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:46,701 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 373 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:46,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1070 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4007 states. [2025-01-09 14:47:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4007 to 4005. [2025-01-09 14:47:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4005 states, 3204 states have (on average 1.5031210986267165) internal successors, (4816), 3212 states have internal predecessors, (4816), 784 states have call successors, (784), 16 states have call predecessors, (784), 16 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-01-09 14:47:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 6384 transitions. [2025-01-09 14:47:46,892 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 6384 transitions. Word has length 474 [2025-01-09 14:47:46,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:46,892 INFO L471 AbstractCegarLoop]: Abstraction has 4005 states and 6384 transitions. [2025-01-09 14:47:46,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 6384 transitions. [2025-01-09 14:47:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-01-09 14:47:46,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:46,900 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:46,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:47:46,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:46,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:46,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1343935198, now seen corresponding path program 1 times [2025-01-09 14:47:46,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:46,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059941806] [2025-01-09 14:47:46,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:46,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:46,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-01-09 14:47:47,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-01-09 14:47:47,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:47,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059941806] [2025-01-09 14:47:47,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059941806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:47,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:47,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673382299] [2025-01-09 14:47:47,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:47,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:47,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:47,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:47,235 INFO L87 Difference]: Start difference. First operand 4005 states and 6384 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:47,853 INFO L93 Difference]: Finished difference Result 12467 states and 19717 transitions. [2025-01-09 14:47:47,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:47,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 475 [2025-01-09 14:47:47,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:47,894 INFO L225 Difference]: With dead ends: 12467 [2025-01-09 14:47:47,894 INFO L226 Difference]: Without dead ends: 8465 [2025-01-09 14:47:47,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:47,906 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 783 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:47,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1499 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:47:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8465 states. [2025-01-09 14:47:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8465 to 4377. [2025-01-09 14:47:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4377 states, 3576 states have (on average 1.5156599552572707) internal successors, (5420), 3584 states have internal predecessors, (5420), 784 states have call successors, (784), 16 states have call predecessors, (784), 16 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-01-09 14:47:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4377 states to 4377 states and 6988 transitions. [2025-01-09 14:47:48,339 INFO L78 Accepts]: Start accepts. Automaton has 4377 states and 6988 transitions. Word has length 475 [2025-01-09 14:47:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:48,340 INFO L471 AbstractCegarLoop]: Abstraction has 4377 states and 6988 transitions. [2025-01-09 14:47:48,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4377 states and 6988 transitions. [2025-01-09 14:47:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-01-09 14:47:48,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:48,347 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:48,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:47:48,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:48,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:48,349 INFO L85 PathProgramCache]: Analyzing trace with hash -929966608, now seen corresponding path program 1 times [2025-01-09 14:47:48,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:48,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642637166] [2025-01-09 14:47:48,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:48,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:48,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-01-09 14:47:48,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-01-09 14:47:48,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:48,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:49,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642637166] [2025-01-09 14:47:49,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642637166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:49,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:49,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503570974] [2025-01-09 14:47:49,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:49,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:49,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:49,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:49,144 INFO L87 Difference]: Start difference. First operand 4377 states and 6988 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:49,575 INFO L93 Difference]: Finished difference Result 12133 states and 19261 transitions. [2025-01-09 14:47:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:49,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 476 [2025-01-09 14:47:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:49,613 INFO L225 Difference]: With dead ends: 12133 [2025-01-09 14:47:49,614 INFO L226 Difference]: Without dead ends: 7759 [2025-01-09 14:47:49,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-01-09 14:47:49,629 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 559 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:49,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1376 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:47:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7759 states. [2025-01-09 14:47:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7759 to 6523. [2025-01-09 14:47:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6523 states, 5322 states have (on average 1.5103344607290492) internal successors, (8038), 5334 states have internal predecessors, (8038), 1176 states have call successors, (1176), 24 states have call predecessors, (1176), 24 states have return successors, (1176), 1164 states have call predecessors, (1176), 1176 states have call successors, (1176) [2025-01-09 14:47:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 10390 transitions. [2025-01-09 14:47:50,041 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 10390 transitions. Word has length 476 [2025-01-09 14:47:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:50,043 INFO L471 AbstractCegarLoop]: Abstraction has 6523 states and 10390 transitions. [2025-01-09 14:47:50,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 10390 transitions. [2025-01-09 14:47:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-01-09 14:47:50,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:50,055 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:50,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:47:50,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:50,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash -959306644, now seen corresponding path program 1 times [2025-01-09 14:47:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:50,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557401452] [2025-01-09 14:47:50,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:50,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:50,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-01-09 14:47:50,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-01-09 14:47:50,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:50,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:51,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:51,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557401452] [2025-01-09 14:47:51,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557401452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:51,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:51,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:51,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021446345] [2025-01-09 14:47:51,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:51,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:51,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:51,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:51,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:51,624 INFO L87 Difference]: Start difference. First operand 6523 states and 10390 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:52,458 INFO L93 Difference]: Finished difference Result 21279 states and 33781 transitions. [2025-01-09 14:47:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:52,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 476 [2025-01-09 14:47:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:52,507 INFO L225 Difference]: With dead ends: 21279 [2025-01-09 14:47:52,507 INFO L226 Difference]: Without dead ends: 14759 [2025-01-09 14:47:52,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:52,527 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 679 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:52,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1436 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:47:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14759 states. [2025-01-09 14:47:53,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14759 to 12873. [2025-01-09 14:47:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12873 states, 10880 states have (on average 1.5104779411764706) internal successors, (16434), 10916 states have internal predecessors, (16434), 1944 states have call successors, (1944), 48 states have call predecessors, (1944), 48 states have return successors, (1944), 1908 states have call predecessors, (1944), 1944 states have call successors, (1944) [2025-01-09 14:47:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12873 states to 12873 states and 20322 transitions. [2025-01-09 14:47:53,136 INFO L78 Accepts]: Start accepts. Automaton has 12873 states and 20322 transitions. Word has length 476 [2025-01-09 14:47:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:53,137 INFO L471 AbstractCegarLoop]: Abstraction has 12873 states and 20322 transitions. [2025-01-09 14:47:53,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 12873 states and 20322 transitions. [2025-01-09 14:47:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-01-09 14:47:53,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:53,148 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:53,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:47:53,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:53,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:53,154 INFO L85 PathProgramCache]: Analyzing trace with hash 917176174, now seen corresponding path program 1 times [2025-01-09 14:47:53,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:53,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732707969] [2025-01-09 14:47:53,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:53,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:53,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-01-09 14:47:53,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-01-09 14:47:53,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:53,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732707969] [2025-01-09 14:47:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732707969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:53,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:53,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:53,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107339235] [2025-01-09 14:47:53,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:53,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:53,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:53,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:53,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:53,709 INFO L87 Difference]: Start difference. First operand 12873 states and 20322 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:54,166 INFO L93 Difference]: Finished difference Result 31693 states and 50048 transitions. [2025-01-09 14:47:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:54,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 476 [2025-01-09 14:47:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:54,229 INFO L225 Difference]: With dead ends: 31693 [2025-01-09 14:47:54,229 INFO L226 Difference]: Without dead ends: 18823 [2025-01-09 14:47:54,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 14:47:54,267 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 301 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:54,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1070 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18823 states. [2025-01-09 14:47:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18823 to 18821. [2025-01-09 14:47:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18821 states, 15832 states have (on average 1.5017685699848409) internal successors, (23776), 15886 states have internal predecessors, (23776), 2916 states have call successors, (2916), 72 states have call predecessors, (2916), 72 states have return successors, (2916), 2862 states have call predecessors, (2916), 2916 states have call successors, (2916) [2025-01-09 14:47:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18821 states to 18821 states and 29608 transitions. [2025-01-09 14:47:55,073 INFO L78 Accepts]: Start accepts. Automaton has 18821 states and 29608 transitions. Word has length 476 [2025-01-09 14:47:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:55,074 INFO L471 AbstractCegarLoop]: Abstraction has 18821 states and 29608 transitions. [2025-01-09 14:47:55,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 18821 states and 29608 transitions. [2025-01-09 14:47:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 14:47:55,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:55,083 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:55,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:47:55,084 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:55,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash 912515184, now seen corresponding path program 1 times [2025-01-09 14:47:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20712410] [2025-01-09 14:47:55,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:55,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:47:55,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:47:55,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:55,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20712410] [2025-01-09 14:47:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20712410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:55,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:55,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:55,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5270021] [2025-01-09 14:47:55,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:55,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:55,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:55,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:55,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:55,399 INFO L87 Difference]: Start difference. First operand 18821 states and 29608 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:56,127 INFO L93 Difference]: Finished difference Result 31693 states and 49928 transitions. [2025-01-09 14:47:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:56,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 477 [2025-01-09 14:47:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:56,201 INFO L225 Difference]: With dead ends: 31693 [2025-01-09 14:47:56,201 INFO L226 Difference]: Without dead ends: 18823 [2025-01-09 14:47:56,239 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-01-09 14:47:56,240 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 377 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:56,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 868 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:56,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18823 states. [2025-01-09 14:47:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18823 to 12873. [2025-01-09 14:47:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12873 states, 10880 states have (on average 1.4988970588235293) internal successors, (16308), 10916 states have internal predecessors, (16308), 1944 states have call successors, (1944), 48 states have call predecessors, (1944), 48 states have return successors, (1944), 1908 states have call predecessors, (1944), 1944 states have call successors, (1944) [2025-01-09 14:47:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12873 states to 12873 states and 20196 transitions. [2025-01-09 14:47:57,058 INFO L78 Accepts]: Start accepts. Automaton has 12873 states and 20196 transitions. Word has length 477 [2025-01-09 14:47:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:57,059 INFO L471 AbstractCegarLoop]: Abstraction has 12873 states and 20196 transitions. [2025-01-09 14:47:57,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 12873 states and 20196 transitions. [2025-01-09 14:47:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 14:47:57,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:57,067 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:57,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:47:57,068 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:57,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1490777167, now seen corresponding path program 1 times [2025-01-09 14:47:57,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:57,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247370854] [2025-01-09 14:47:57,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:57,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:47:57,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:47:57,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:57,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:47:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247370854] [2025-01-09 14:47:57,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247370854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:57,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:57,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670262891] [2025-01-09 14:47:57,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:57,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:57,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:57,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:57,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:57,807 INFO L87 Difference]: Start difference. First operand 12873 states and 20196 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:47:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:58,897 INFO L93 Difference]: Finished difference Result 42199 states and 66279 transitions. [2025-01-09 14:47:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:58,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 477 [2025-01-09 14:47:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:58,993 INFO L225 Difference]: With dead ends: 42199 [2025-01-09 14:47:58,993 INFO L226 Difference]: Without dead ends: 29329 [2025-01-09 14:47:59,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:47:59,025 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 675 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:59,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1891 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:47:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29329 states. [2025-01-09 14:48:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29329 to 26617. [2025-01-09 14:48:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26617 states, 22632 states have (on average 1.5024743725698126) internal successors, (34004), 22704 states have internal predecessors, (34004), 3888 states have call successors, (3888), 96 states have call predecessors, (3888), 96 states have return successors, (3888), 3816 states have call predecessors, (3888), 3888 states have call successors, (3888) [2025-01-09 14:48:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26617 states to 26617 states and 41780 transitions. [2025-01-09 14:48:00,148 INFO L78 Accepts]: Start accepts. Automaton has 26617 states and 41780 transitions. Word has length 477 [2025-01-09 14:48:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:00,149 INFO L471 AbstractCegarLoop]: Abstraction has 26617 states and 41780 transitions. [2025-01-09 14:48:00,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 26617 states and 41780 transitions. [2025-01-09 14:48:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 14:48:00,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:00,163 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:00,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:48:00,163 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:00,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash 998751795, now seen corresponding path program 1 times [2025-01-09 14:48:00,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:00,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456336288] [2025-01-09 14:48:00,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:00,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:00,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:48:01,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:48:01,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:01,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:48:02,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:02,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456336288] [2025-01-09 14:48:02,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456336288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:02,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:02,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:48:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784113169] [2025-01-09 14:48:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:02,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:48:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:02,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:48:02,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:48:02,644 INFO L87 Difference]: Start difference. First operand 26617 states and 41780 transitions. Second operand has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:48:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:06,584 INFO L93 Difference]: Finished difference Result 141903 states and 221112 transitions. [2025-01-09 14:48:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:48:06,584 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 477 [2025-01-09 14:48:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:06,969 INFO L225 Difference]: With dead ends: 141903 [2025-01-09 14:48:06,969 INFO L226 Difference]: Without dead ends: 115289 [2025-01-09 14:48:07,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:48:07,047 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 3491 mSDsluCounter, 3493 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3491 SdHoareTripleChecker+Valid, 4088 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:07,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3491 Valid, 4088 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:48:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115289 states. [2025-01-09 14:48:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115289 to 72269. [2025-01-09 14:48:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72269 states, 63628 states have (on average 1.5116300999559942) internal successors, (96182), 63868 states have internal predecessors, (96182), 8256 states have call successors, (8256), 384 states have call predecessors, (8256), 384 states have return successors, (8256), 8016 states have call predecessors, (8256), 8256 states have call successors, (8256) [2025-01-09 14:48:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72269 states to 72269 states and 112694 transitions. [2025-01-09 14:48:10,731 INFO L78 Accepts]: Start accepts. Automaton has 72269 states and 112694 transitions. Word has length 477 [2025-01-09 14:48:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:10,732 INFO L471 AbstractCegarLoop]: Abstraction has 72269 states and 112694 transitions. [2025-01-09 14:48:10,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:48:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 72269 states and 112694 transitions. [2025-01-09 14:48:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 14:48:10,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:10,767 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:10,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:48:10,768 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:10,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1892238133, now seen corresponding path program 1 times [2025-01-09 14:48:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:10,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034060597] [2025-01-09 14:48:10,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:11,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:48:12,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:48:12,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:12,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 90 proven. 108 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:12,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034060597] [2025-01-09 14:48:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034060597] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:12,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580246883] [2025-01-09 14:48:12,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:12,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:12,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:12,824 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-01-09 14:48:12,830 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-01-09 14:48:12,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:48:13,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:48:13,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:13,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:13,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:48:13,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4446 proven. 108 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2025-01-09 14:48:13,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 90 proven. 108 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:13,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580246883] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:13,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:13,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:48:13,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968619593] [2025-01-09 14:48:13,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:13,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:48:13,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:13,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:48:13,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:48:13,830 INFO L87 Difference]: Start difference. First operand 72269 states and 112694 transitions. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 2 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-01-09 14:48:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:16,437 INFO L93 Difference]: Finished difference Result 146071 states and 226729 transitions. [2025-01-09 14:48:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:48:16,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 2 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) Word has length 477 [2025-01-09 14:48:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:16,627 INFO L225 Difference]: With dead ends: 146071 [2025-01-09 14:48:16,627 INFO L226 Difference]: Without dead ends: 73805 [2025-01-09 14:48:16,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 951 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:48:16,725 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 286 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:16,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 953 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:48:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73805 states. [2025-01-09 14:48:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73805 to 72365. [2025-01-09 14:48:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72365 states, 63820 states have (on average 1.5059542463177686) internal successors, (96110), 64060 states have internal predecessors, (96110), 8064 states have call successors, (8064), 480 states have call predecessors, (8064), 480 states have return successors, (8064), 7824 states have call predecessors, (8064), 8064 states have call successors, (8064) [2025-01-09 14:48:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72365 states to 72365 states and 112238 transitions. [2025-01-09 14:48:20,069 INFO L78 Accepts]: Start accepts. Automaton has 72365 states and 112238 transitions. Word has length 477 [2025-01-09 14:48:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:20,069 INFO L471 AbstractCegarLoop]: Abstraction has 72365 states and 112238 transitions. [2025-01-09 14:48:20,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 2 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-01-09 14:48:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 72365 states and 112238 transitions. [2025-01-09 14:48:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 14:48:20,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:20,103 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:20,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:48:20,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:20,305 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:20,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash -18804425, now seen corresponding path program 1 times [2025-01-09 14:48:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:20,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598899376] [2025-01-09 14:48:20,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:20,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:48:21,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:48:21,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:21,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3 proven. 195 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598899376] [2025-01-09 14:48:23,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598899376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930186042] [2025-01-09 14:48:23,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:23,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:23,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:23,197 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-01-09 14:48:23,206 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-01-09 14:48:23,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:48:23,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:48:23,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:23,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:23,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:48:23,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3936 proven. 63 refuted. 0 times theorem prover too weak. 4845 trivial. 0 not checked. [2025-01-09 14:48:23,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 135 proven. 63 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930186042] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:24,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:24,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2025-01-09 14:48:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706538709] [2025-01-09 14:48:24,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:24,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:48:24,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:24,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:48:24,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:48:24,102 INFO L87 Difference]: Start difference. First operand 72365 states and 112238 transitions. Second operand has 13 states, 13 states have (on average 21.53846153846154) internal successors, (280), 13 states have internal predecessors, (280), 5 states have call successors, (155), 2 states have call predecessors, (155), 4 states have return successors, (156), 5 states have call predecessors, (156), 5 states have call successors, (156) [2025-01-09 14:48:28,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:28,939 INFO L93 Difference]: Finished difference Result 203625 states and 314671 transitions. [2025-01-09 14:48:28,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 14:48:28,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.53846153846154) internal successors, (280), 13 states have internal predecessors, (280), 5 states have call successors, (155), 2 states have call predecessors, (155), 4 states have return successors, (156), 5 states have call predecessors, (156), 5 states have call successors, (156) Word has length 477 [2025-01-09 14:48:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:29,217 INFO L225 Difference]: With dead ends: 203625 [2025-01-09 14:48:29,217 INFO L226 Difference]: Without dead ends: 131263 [2025-01-09 14:48:29,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 992 GetRequests, 954 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 14:48:29,322 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 2228 mSDsluCounter, 3481 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2274 SdHoareTripleChecker+Valid, 3874 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:29,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2274 Valid, 3874 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 14:48:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131263 states. [2025-01-09 14:48:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131263 to 110185. [2025-01-09 14:48:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110185 states, 97222 states have (on average 1.4889839748205138) internal successors, (144762), 97582 states have internal predecessors, (144762), 12163 states have call successors, (12163), 799 states have call predecessors, (12163), 799 states have return successors, (12163), 11803 states have call predecessors, (12163), 12163 states have call successors, (12163) [2025-01-09 14:48:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110185 states to 110185 states and 169088 transitions. [2025-01-09 14:48:34,516 INFO L78 Accepts]: Start accepts. Automaton has 110185 states and 169088 transitions. Word has length 477 [2025-01-09 14:48:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:34,516 INFO L471 AbstractCegarLoop]: Abstraction has 110185 states and 169088 transitions. [2025-01-09 14:48:34,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.53846153846154) internal successors, (280), 13 states have internal predecessors, (280), 5 states have call successors, (155), 2 states have call predecessors, (155), 4 states have return successors, (156), 5 states have call predecessors, (156), 5 states have call successors, (156) [2025-01-09 14:48:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 110185 states and 169088 transitions. [2025-01-09 14:48:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:48:34,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:34,540 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:34,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:48:34,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:34,741 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:34,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:34,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1787514403, now seen corresponding path program 1 times [2025-01-09 14:48:34,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:34,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140829824] [2025-01-09 14:48:34,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:34,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:48:34,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:48:34,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:34,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:48:35,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:35,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140829824] [2025-01-09 14:48:35,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140829824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:35,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:35,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:48:35,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903499237] [2025-01-09 14:48:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:35,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:48:35,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:35,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:48:35,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:35,184 INFO L87 Difference]: Start difference. First operand 110185 states and 169088 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:41,530 INFO L93 Difference]: Finished difference Result 323053 states and 495124 transitions. [2025-01-09 14:48:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:48:41,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:48:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:42,129 INFO L225 Difference]: With dead ends: 323053 [2025-01-09 14:48:42,129 INFO L226 Difference]: Without dead ends: 213011 [2025-01-09 14:48:42,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:48:42,343 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 695 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:42,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1417 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:48:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213011 states. [2025-01-09 14:48:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213011 to 212937. [2025-01-09 14:48:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212937 states, 188452 states have (on average 1.4809606690297794) internal successors, (279090), 189244 states have internal predecessors, (279090), 22819 states have call successors, (22819), 1665 states have call predecessors, (22819), 1665 states have return successors, (22819), 22027 states have call predecessors, (22819), 22819 states have call successors, (22819) [2025-01-09 14:48:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212937 states to 212937 states and 324728 transitions. [2025-01-09 14:48:51,388 INFO L78 Accepts]: Start accepts. Automaton has 212937 states and 324728 transitions. Word has length 478 [2025-01-09 14:48:51,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:51,389 INFO L471 AbstractCegarLoop]: Abstraction has 212937 states and 324728 transitions. [2025-01-09 14:48:51,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 212937 states and 324728 transitions. [2025-01-09 14:48:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:48:51,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:51,544 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:51,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:48:51,544 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash 596410335, now seen corresponding path program 1 times [2025-01-09 14:48:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:51,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354603330] [2025-01-09 14:48:51,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:51,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes.