./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-64.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-64.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 e3b150a17e2463cebe76496dbc2347bb2e3ca7c0b4d818609f62a20afc82666e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:48:56,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:48:56,956 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:48:56,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:48:56,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:48:56,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:48:56,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:48:56,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:48:56,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:48:56,981 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:48:56,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:48:56,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:48:56,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:48:56,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:48:56,983 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:48:56,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:48:56,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:48:56,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:48:56,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:48:56,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:48:56,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:48:56,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:48:56,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:48:56,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:48:56,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:48:56,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:48:56,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:48:56,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:48:56,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:48:56,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:48:56,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:48:56,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:48:56,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:48:56,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:48:56,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:48:56,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:48:56,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:48:56,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:48:56,986 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 -> e3b150a17e2463cebe76496dbc2347bb2e3ca7c0b4d818609f62a20afc82666e [2025-01-09 14:48:57,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:48:57,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:48:57,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:48:57,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:48:57,211 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:48:57,212 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-64.i [2025-01-09 14:48:58,360 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/135b37c2b/2d70b983ecea4b43b039952f32f37b75/FLAG4d30f85fa [2025-01-09 14:48:58,683 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:48:58,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-64.i [2025-01-09 14:48:58,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/135b37c2b/2d70b983ecea4b43b039952f32f37b75/FLAG4d30f85fa [2025-01-09 14:48:58,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/135b37c2b/2d70b983ecea4b43b039952f32f37b75 [2025-01-09 14:48:58,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:48:58,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:48:58,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:48:58,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:48:58,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:48:58,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:58" (1/1) ... [2025-01-09 14:48:58,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413dff3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:58, skipping insertion in model container [2025-01-09 14:48:58,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:58" (1/1) ... [2025-01-09 14:48:58,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:48:59,082 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-64.i[916,929] [2025-01-09 14:48:59,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:48:59,278 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:48:59,288 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-64.i[916,929] [2025-01-09 14:48:59,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:48:59,401 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:48:59,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59 WrapperNode [2025-01-09 14:48:59,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:48:59,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:48:59,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:48:59,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:48:59,409 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:48:59" (1/1) ... [2025-01-09 14:48:59,424 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:48:59" (1/1) ... [2025-01-09 14:48:59,504 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 701 [2025-01-09 14:48:59,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:48:59,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:48:59,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:48:59,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:48:59,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,630 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:48:59,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:48:59,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:48:59,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:48:59,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:48:59,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (1/1) ... [2025-01-09 14:48:59,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:48:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:59,769 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:48:59,771 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:48:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:48:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:48:59,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:48:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:48:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:48:59,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:48:59,889 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:48:59,891 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:49:00,927 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2025-01-09 14:49:00,928 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:49:00,943 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:49:00,946 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:49:00,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:00 BoogieIcfgContainer [2025-01-09 14:49:00,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:49:00,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:49:00,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:49:00,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:49:00,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:48:58" (1/3) ... [2025-01-09 14:49:00,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3358ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:00, skipping insertion in model container [2025-01-09 14:49:00,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:59" (2/3) ... [2025-01-09 14:49:00,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3358ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:00, skipping insertion in model container [2025-01-09 14:49:00,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:00" (3/3) ... [2025-01-09 14:49:00,954 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-64.i [2025-01-09 14:49:00,968 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:49:00,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-64.i that has 2 procedures, 274 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:49:01,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:49:01,019 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;@b3f984c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:49:01,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:49:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 206 states have (on average 1.5776699029126213) internal successors, (325), 207 states have internal predecessors, (325), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 14:49:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 14:49:01,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:01,047 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:01,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:01,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:01,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1220025292, now seen corresponding path program 1 times [2025-01-09 14:49:01,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:01,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095815396] [2025-01-09 14:49:01,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:01,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:01,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 14:49:01,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 14:49:01,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:01,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-01-09 14:49:01,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:01,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095815396] [2025-01-09 14:49:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095815396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:49:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140989027] [2025-01-09 14:49:01,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:01,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:49:01,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:49:01,559 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:49:01,561 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:49:01,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 14:49:01,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 14:49:01,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:01,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:01,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:49:01,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:49:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-01-09 14:49:01,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:49:01,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140989027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:01,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:49:01,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:49:01,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305089500] [2025-01-09 14:49:01,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:01,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:49:01,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:01,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:49:01,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:49:01,973 INFO L87 Difference]: Start difference. First operand has 274 states, 206 states have (on average 1.5776699029126213) internal successors, (325), 207 states have internal predecessors, (325), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-01-09 14:49:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:02,021 INFO L93 Difference]: Finished difference Result 540 states and 966 transitions. [2025-01-09 14:49:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:49:02,023 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) Word has length 434 [2025-01-09 14:49:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:02,032 INFO L225 Difference]: With dead ends: 540 [2025-01-09 14:49:02,033 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 14:49:02,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 435 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:49:02,041 INFO L435 NwaCegarLoop]: 444 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, 444 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:49:02,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 14:49:02,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-01-09 14:49:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 202 states have (on average 1.5544554455445545) internal successors, (314), 202 states have internal predecessors, (314), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 14:49:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 444 transitions. [2025-01-09 14:49:02,102 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 444 transitions. Word has length 434 [2025-01-09 14:49:02,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:02,103 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 444 transitions. [2025-01-09 14:49:02,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-01-09 14:49:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 444 transitions. [2025-01-09 14:49:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 14:49:02,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:02,110 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:02,118 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:49:02,314 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:49:02,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:02,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1953183318, now seen corresponding path program 1 times [2025-01-09 14:49:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:02,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961382185] [2025-01-09 14:49:02,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:02,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 14:49:02,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 14:49:02,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:02,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:49:02,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:02,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961382185] [2025-01-09 14:49:02,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961382185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:02,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:02,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:02,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315136511] [2025-01-09 14:49:02,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:02,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:02,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:02,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:02,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:02,776 INFO L87 Difference]: Start difference. First operand 269 states and 444 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:02,879 INFO L93 Difference]: Finished difference Result 739 states and 1223 transitions. [2025-01-09 14:49:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:02,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2025-01-09 14:49:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:02,888 INFO L225 Difference]: With dead ends: 739 [2025-01-09 14:49:02,888 INFO L226 Difference]: Without dead ends: 473 [2025-01-09 14:49:02,890 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:49:02,890 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 326 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:02,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 853 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:49:02,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-01-09 14:49:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 470. [2025-01-09 14:49:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 376 states have (on average 1.5824468085106382) internal successors, (595), 377 states have internal predecessors, (595), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 14:49:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 777 transitions. [2025-01-09 14:49:02,932 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 777 transitions. Word has length 434 [2025-01-09 14:49:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:02,932 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 777 transitions. [2025-01-09 14:49:02,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 777 transitions. [2025-01-09 14:49:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 14:49:02,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:02,936 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:02,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:49:02,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:02,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1080866728, now seen corresponding path program 1 times [2025-01-09 14:49:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29869712] [2025-01-09 14:49:02,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:02,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 14:49:03,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 14:49:03,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:03,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:49:03,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:03,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29869712] [2025-01-09 14:49:03,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29869712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:03,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:03,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:03,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75599081] [2025-01-09 14:49:03,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:03,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:03,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:03,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:03,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:03,344 INFO L87 Difference]: Start difference. First operand 470 states and 777 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:03,449 INFO L93 Difference]: Finished difference Result 1403 states and 2323 transitions. [2025-01-09 14:49:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:03,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2025-01-09 14:49:03,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:03,462 INFO L225 Difference]: With dead ends: 1403 [2025-01-09 14:49:03,462 INFO L226 Difference]: Without dead ends: 936 [2025-01-09 14:49:03,464 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:49:03,465 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 425 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:03,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1045 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:49:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-01-09 14:49:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 934. [2025-01-09 14:49:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 747 states have (on average 1.5809906291834002) internal successors, (1181), 749 states have internal predecessors, (1181), 182 states have call successors, (182), 4 states have call predecessors, (182), 4 states have return successors, (182), 180 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 14:49:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1545 transitions. [2025-01-09 14:49:03,554 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1545 transitions. Word has length 434 [2025-01-09 14:49:03,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:03,556 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1545 transitions. [2025-01-09 14:49:03,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1545 transitions. [2025-01-09 14:49:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 14:49:03,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:03,561 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:03,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:49:03,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:03,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:03,561 INFO L85 PathProgramCache]: Analyzing trace with hash 305918682, now seen corresponding path program 1 times [2025-01-09 14:49:03,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:03,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190848776] [2025-01-09 14:49:03,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:03,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:03,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 14:49:03,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 14:49:03,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:03,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:49:03,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:03,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190848776] [2025-01-09 14:49:03,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190848776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:03,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:03,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582023240] [2025-01-09 14:49:03,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:03,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:03,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:03,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:03,844 INFO L87 Difference]: Start difference. First operand 934 states and 1545 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:03,951 INFO L93 Difference]: Finished difference Result 2696 states and 4473 transitions. [2025-01-09 14:49:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:03,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2025-01-09 14:49:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:03,963 INFO L225 Difference]: With dead ends: 2696 [2025-01-09 14:49:03,964 INFO L226 Difference]: Without dead ends: 1765 [2025-01-09 14:49:03,966 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:49:03,968 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 391 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:03,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1075 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-01-09 14:49:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1058. [2025-01-09 14:49:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 871 states have (on average 1.6039035591274398) internal successors, (1397), 873 states have internal predecessors, (1397), 182 states have call successors, (182), 4 states have call predecessors, (182), 4 states have return successors, (182), 180 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 14:49:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1761 transitions. [2025-01-09 14:49:04,101 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1761 transitions. Word has length 434 [2025-01-09 14:49:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:04,103 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1761 transitions. [2025-01-09 14:49:04,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1761 transitions. [2025-01-09 14:49:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 14:49:04,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:04,111 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:04,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:49:04,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:04,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:04,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1539448484, now seen corresponding path program 1 times [2025-01-09 14:49:04,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:04,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855770437] [2025-01-09 14:49:04,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:04,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:04,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 14:49:04,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 14:49:04,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:04,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:49:05,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:05,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855770437] [2025-01-09 14:49:05,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855770437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:49:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012155726] [2025-01-09 14:49:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:05,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:49:05,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:05,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:49:05,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:05,388 INFO L87 Difference]: Start difference. First operand 1058 states and 1761 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:05,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:05,811 INFO L93 Difference]: Finished difference Result 2974 states and 4966 transitions. [2025-01-09 14:49:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:49:05,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2025-01-09 14:49:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:05,822 INFO L225 Difference]: With dead ends: 2974 [2025-01-09 14:49:05,822 INFO L226 Difference]: Without dead ends: 1919 [2025-01-09 14:49:05,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:05,828 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 351 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:05,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1284 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:49:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2025-01-09 14:49:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1813. [2025-01-09 14:49:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1559 states have (on average 1.6350224502886466) internal successors, (2549), 1561 states have internal predecessors, (2549), 247 states have call successors, (247), 6 states have call predecessors, (247), 6 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) [2025-01-09 14:49:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 3043 transitions. [2025-01-09 14:49:05,970 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 3043 transitions. Word has length 434 [2025-01-09 14:49:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:05,971 INFO L471 AbstractCegarLoop]: Abstraction has 1813 states and 3043 transitions. [2025-01-09 14:49:05,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 3043 transitions. [2025-01-09 14:49:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 14:49:05,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:05,979 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:05,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:49:05,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:05,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1432675137, now seen corresponding path program 1 times [2025-01-09 14:49:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903905264] [2025-01-09 14:49:05,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:06,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 14:49:06,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 14:49:06,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:06,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:49:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903905264] [2025-01-09 14:49:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903905264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:07,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:07,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:49:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123762124] [2025-01-09 14:49:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:07,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:49:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:07,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:49:07,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:07,184 INFO L87 Difference]: Start difference. First operand 1813 states and 3043 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:07,649 INFO L93 Difference]: Finished difference Result 5437 states and 9152 transitions. [2025-01-09 14:49:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:49:07,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 436 [2025-01-09 14:49:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:07,669 INFO L225 Difference]: With dead ends: 5437 [2025-01-09 14:49:07,669 INFO L226 Difference]: Without dead ends: 4214 [2025-01-09 14:49:07,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:49:07,674 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 685 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:07,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1792 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:49:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2025-01-09 14:49:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 3247. [2025-01-09 14:49:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 2849 states have (on average 1.669006669006669) internal successors, (4755), 2855 states have internal predecessors, (4755), 387 states have call successors, (387), 10 states have call predecessors, (387), 10 states have return successors, (387), 381 states have call predecessors, (387), 387 states have call successors, (387) [2025-01-09 14:49:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 5529 transitions. [2025-01-09 14:49:07,858 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 5529 transitions. Word has length 436 [2025-01-09 14:49:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:07,859 INFO L471 AbstractCegarLoop]: Abstraction has 3247 states and 5529 transitions. [2025-01-09 14:49:07,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 5529 transitions. [2025-01-09 14:49:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 14:49:07,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:07,863 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:07,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:49:07,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:07,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1009028415, now seen corresponding path program 1 times [2025-01-09 14:49:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:07,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014876415] [2025-01-09 14:49:07,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:07,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 14:49:09,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 14:49:09,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:09,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:49:19,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:19,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014876415] [2025-01-09 14:49:19,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014876415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:19,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:19,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 14:49:19,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698109458] [2025-01-09 14:49:19,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:19,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 14:49:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:19,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 14:49:19,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:49:19,053 INFO L87 Difference]: Start difference. First operand 3247 states and 5529 transitions. Second operand has 20 states, 20 states have (on average 5.7) internal successors, (114), 20 states have internal predecessors, (114), 6 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 6 states have call predecessors, (65), 6 states have call successors, (65) [2025-01-09 14:49:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:28,702 INFO L93 Difference]: Finished difference Result 8950 states and 14932 transitions. [2025-01-09 14:49:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:49:28,703 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.7) internal successors, (114), 20 states have internal predecessors, (114), 6 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 6 states have call predecessors, (65), 6 states have call successors, (65) Word has length 436 [2025-01-09 14:49:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:28,732 INFO L225 Difference]: With dead ends: 8950 [2025-01-09 14:49:28,732 INFO L226 Difference]: Without dead ends: 6841 [2025-01-09 14:49:28,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 14:49:28,739 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 2667 mSDsluCounter, 6555 mSDsCounter, 0 mSdLazyCounter, 4554 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 7384 SdHoareTripleChecker+Invalid, 5019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 4554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:28,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2667 Valid, 7384 Invalid, 5019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 4554 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-01-09 14:49:28,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6841 states. [2025-01-09 14:49:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6841 to 4559. [2025-01-09 14:49:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4559 states, 4087 states have (on average 1.6572057744066553) internal successors, (6773), 4101 states have internal predecessors, (6773), 451 states have call successors, (451), 20 states have call predecessors, (451), 20 states have return successors, (451), 437 states have call predecessors, (451), 451 states have call successors, (451) [2025-01-09 14:49:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4559 states to 4559 states and 7675 transitions. [2025-01-09 14:49:28,985 INFO L78 Accepts]: Start accepts. Automaton has 4559 states and 7675 transitions. Word has length 436 [2025-01-09 14:49:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:28,987 INFO L471 AbstractCegarLoop]: Abstraction has 4559 states and 7675 transitions. [2025-01-09 14:49:28,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.7) internal successors, (114), 20 states have internal predecessors, (114), 6 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 6 states have call predecessors, (65), 6 states have call successors, (65) [2025-01-09 14:49:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4559 states and 7675 transitions. [2025-01-09 14:49:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 14:49:28,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:28,992 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:28,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:49:28,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:28,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -115542077, now seen corresponding path program 1 times [2025-01-09 14:49:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386556209] [2025-01-09 14:49:28,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:29,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 14:49:29,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 14:49:29,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:29,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:49:30,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386556209] [2025-01-09 14:49:30,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386556209] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:49:30,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936528923] [2025-01-09 14:49:30,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:30,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:49:30,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:49:30,929 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:49:30,934 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:49:31,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 14:49:31,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 14:49:31,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:31,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:31,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:49:31,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:49:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 4182 proven. 105 refuted. 0 times theorem prover too weak. 4033 trivial. 0 not checked. [2025-01-09 14:49:31,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:49:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 87 proven. 105 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:49:31,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936528923] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:49:31,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:49:31,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-01-09 14:49:31,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064892630] [2025-01-09 14:49:31,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:49:31,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:49:31,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:31,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:49:31,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:49:31,827 INFO L87 Difference]: Start difference. First operand 4559 states and 7675 transitions. Second operand has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 4 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (166), 4 states have call predecessors, (166), 4 states have call successors, (166) [2025-01-09 14:49:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:33,579 INFO L93 Difference]: Finished difference Result 11317 states and 18949 transitions. [2025-01-09 14:49:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 14:49:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 4 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (166), 4 states have call predecessors, (166), 4 states have call successors, (166) Word has length 436 [2025-01-09 14:49:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:33,607 INFO L225 Difference]: With dead ends: 11317 [2025-01-09 14:49:33,607 INFO L226 Difference]: Without dead ends: 6924 [2025-01-09 14:49:33,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 873 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 14:49:33,615 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1832 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:33,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 2171 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 14:49:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6924 states. [2025-01-09 14:49:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6924 to 5626. [2025-01-09 14:49:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5626 states, 4870 states have (on average 1.6299794661190965) internal successors, (7938), 4882 states have internal predecessors, (7938), 709 states have call successors, (709), 46 states have call predecessors, (709), 46 states have return successors, (709), 697 states have call predecessors, (709), 709 states have call successors, (709) [2025-01-09 14:49:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5626 states to 5626 states and 9356 transitions. [2025-01-09 14:49:34,062 INFO L78 Accepts]: Start accepts. Automaton has 5626 states and 9356 transitions. Word has length 436 [2025-01-09 14:49:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:34,063 INFO L471 AbstractCegarLoop]: Abstraction has 5626 states and 9356 transitions. [2025-01-09 14:49:34,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 4 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (166), 4 states have call predecessors, (166), 4 states have call successors, (166) [2025-01-09 14:49:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5626 states and 9356 transitions. [2025-01-09 14:49:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:49:34,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:34,069 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:34,078 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:49:34,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:49:34,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:34,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash 749129100, now seen corresponding path program 1 times [2025-01-09 14:49:34,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:34,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860787567] [2025-01-09 14:49:34,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:34,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:34,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:49:35,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:49:35,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:35,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:49:44,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860787567] [2025-01-09 14:49:44,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860787567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:44,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:44,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-01-09 14:49:44,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405576976] [2025-01-09 14:49:44,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:44,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 14:49:44,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:44,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 14:49:44,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:49:44,374 INFO L87 Difference]: Start difference. First operand 5626 states and 9356 transitions. Second operand has 24 states, 24 states have (on average 4.791666666666667) internal successors, (115), 24 states have internal predecessors, (115), 6 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 6 states have call predecessors, (65), 6 states have call successors, (65) [2025-01-09 14:49:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:56,486 INFO L93 Difference]: Finished difference Result 19870 states and 32570 transitions. [2025-01-09 14:49:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 14:49:56,487 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.791666666666667) internal successors, (115), 24 states have internal predecessors, (115), 6 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 6 states have call predecessors, (65), 6 states have call successors, (65) Word has length 437 [2025-01-09 14:49:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:56,550 INFO L225 Difference]: With dead ends: 19870 [2025-01-09 14:49:56,551 INFO L226 Difference]: Without dead ends: 15926 [2025-01-09 14:49:56,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 14:49:56,572 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 7468 mSDsluCounter, 6814 mSDsCounter, 0 mSdLazyCounter, 5738 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7468 SdHoareTripleChecker+Valid, 7533 SdHoareTripleChecker+Invalid, 6544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 5738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:56,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7468 Valid, 7533 Invalid, 6544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [806 Valid, 5738 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-01-09 14:49:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15926 states. [2025-01-09 14:49:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15926 to 9054. [2025-01-09 14:49:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9054 states, 8021 states have (on average 1.6198728338112456) internal successors, (12993), 8057 states have internal predecessors, (12993), 941 states have call successors, (941), 91 states have call predecessors, (941), 91 states have return successors, (941), 905 states have call predecessors, (941), 941 states have call successors, (941) [2025-01-09 14:49:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9054 states to 9054 states and 14875 transitions. [2025-01-09 14:49:57,217 INFO L78 Accepts]: Start accepts. Automaton has 9054 states and 14875 transitions. Word has length 437 [2025-01-09 14:49:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:57,217 INFO L471 AbstractCegarLoop]: Abstraction has 9054 states and 14875 transitions. [2025-01-09 14:49:57,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.791666666666667) internal successors, (115), 24 states have internal predecessors, (115), 6 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 6 states have call predecessors, (65), 6 states have call successors, (65) [2025-01-09 14:49:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 9054 states and 14875 transitions. [2025-01-09 14:49:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:49:57,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:57,228 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:57,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:49:57,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:57,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1392797396, now seen corresponding path program 1 times [2025-01-09 14:49:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:57,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641469795] [2025-01-09 14:49:57,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:57,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:57,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:49:57,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:49:57,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:57,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:49:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:58,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641469795] [2025-01-09 14:49:58,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641469795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:58,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:58,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:49:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136391182] [2025-01-09 14:49:58,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:58,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:49:58,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:58,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:49:58,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:58,138 INFO L87 Difference]: Start difference. First operand 9054 states and 14875 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:49:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:59,358 INFO L93 Difference]: Finished difference Result 19326 states and 32044 transitions. [2025-01-09 14:49:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:49:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 437 [2025-01-09 14:49:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:59,395 INFO L225 Difference]: With dead ends: 19326 [2025-01-09 14:49:59,395 INFO L226 Difference]: Without dead ends: 15649 [2025-01-09 14:49:59,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 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:49:59,403 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 1052 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:59,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1298 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:49:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15649 states. [2025-01-09 14:50:00,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15649 to 12462. [2025-01-09 14:50:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12462 states, 11173 states have (on average 1.6266893403741163) internal successors, (18175), 11225 states have internal predecessors, (18175), 1181 states have call successors, (1181), 107 states have call predecessors, (1181), 107 states have return successors, (1181), 1129 states have call predecessors, (1181), 1181 states have call successors, (1181) [2025-01-09 14:50:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12462 states to 12462 states and 20537 transitions. [2025-01-09 14:50:00,133 INFO L78 Accepts]: Start accepts. Automaton has 12462 states and 20537 transitions. Word has length 437 [2025-01-09 14:50:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:00,133 INFO L471 AbstractCegarLoop]: Abstraction has 12462 states and 20537 transitions. [2025-01-09 14:50:00,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:50:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 12462 states and 20537 transitions. [2025-01-09 14:50:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:50:00,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:00,146 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:50:00,146 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:00,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1056802734, now seen corresponding path program 1 times [2025-01-09 14:50:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:00,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215720229] [2025-01-09 14:50:00,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:00,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:00,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:00,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:00,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:00,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:50:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:00,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215720229] [2025-01-09 14:50:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215720229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:00,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12156077] [2025-01-09 14:50:00,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:00,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:00,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:00,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:00,872 INFO L87 Difference]: Start difference. First operand 12462 states and 20537 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:50:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:02,104 INFO L93 Difference]: Finished difference Result 33296 states and 54578 transitions. [2025-01-09 14:50:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:02,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 437 [2025-01-09 14:50:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:02,155 INFO L225 Difference]: With dead ends: 33296 [2025-01-09 14:50:02,155 INFO L226 Difference]: Without dead ends: 22312 [2025-01-09 14:50:02,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:50:02,173 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 525 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:02,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 995 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:50:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22312 states. [2025-01-09 14:50:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22312 to 16618. [2025-01-09 14:50:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16618 states, 15312 states have (on average 1.6581765935214212) internal successors, (25390), 15364 states have internal predecessors, (25390), 1181 states have call successors, (1181), 124 states have call predecessors, (1181), 124 states have return successors, (1181), 1129 states have call predecessors, (1181), 1181 states have call successors, (1181) [2025-01-09 14:50:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16618 states to 16618 states and 27752 transitions. [2025-01-09 14:50:03,092 INFO L78 Accepts]: Start accepts. Automaton has 16618 states and 27752 transitions. Word has length 437 [2025-01-09 14:50:03,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:03,093 INFO L471 AbstractCegarLoop]: Abstraction has 16618 states and 27752 transitions. [2025-01-09 14:50:03,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:50:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 16618 states and 27752 transitions. [2025-01-09 14:50:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:50:03,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:03,110 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:03,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:50:03,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:03,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1617565494, now seen corresponding path program 1 times [2025-01-09 14:50:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586733094] [2025-01-09 14:50:03,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:03,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:03,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:05,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:05,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:05,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 54 proven. 138 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:50:05,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586733094] [2025-01-09 14:50:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586733094] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919194589] [2025-01-09 14:50:05,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:05,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:05,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:05,667 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:50:05,672 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:50:05,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:05,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:05,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:05,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:05,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:50:05,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 3412 proven. 138 refuted. 0 times theorem prover too weak. 4770 trivial. 0 not checked. [2025-01-09 14:50:06,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 54 proven. 138 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:50:06,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919194589] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:06,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:06,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 14:50:06,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516120575] [2025-01-09 14:50:06,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:06,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:50:06,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:06,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:50:06,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:50:06,710 INFO L87 Difference]: Start difference. First operand 16618 states and 27752 transitions. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 3 states have call successors, (157), 2 states have call predecessors, (157), 4 states have return successors, (158), 3 states have call predecessors, (158), 3 states have call successors, (158) [2025-01-09 14:50:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:07,819 INFO L93 Difference]: Finished difference Result 28258 states and 46976 transitions. [2025-01-09 14:50:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:50:07,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 3 states have call successors, (157), 2 states have call predecessors, (157), 4 states have return successors, (158), 3 states have call predecessors, (158), 3 states have call successors, (158) Word has length 437 [2025-01-09 14:50:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:07,858 INFO L225 Difference]: With dead ends: 28258 [2025-01-09 14:50:07,858 INFO L226 Difference]: Without dead ends: 16862 [2025-01-09 14:50:07,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 870 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:50:07,879 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 499 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:07,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1252 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:50:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16862 states. [2025-01-09 14:50:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16862 to 16790. [2025-01-09 14:50:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16790 states, 15459 states have (on average 1.6519179765832201) internal successors, (25537), 15511 states have internal predecessors, (25537), 1181 states have call successors, (1181), 149 states have call predecessors, (1181), 149 states have return successors, (1181), 1129 states have call predecessors, (1181), 1181 states have call successors, (1181) [2025-01-09 14:50:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16790 states to 16790 states and 27899 transitions. [2025-01-09 14:50:08,744 INFO L78 Accepts]: Start accepts. Automaton has 16790 states and 27899 transitions. Word has length 437 [2025-01-09 14:50:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:08,745 INFO L471 AbstractCegarLoop]: Abstraction has 16790 states and 27899 transitions. [2025-01-09 14:50:08,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 3 states have call successors, (157), 2 states have call predecessors, (157), 4 states have return successors, (158), 3 states have call predecessors, (158), 3 states have call successors, (158) [2025-01-09 14:50:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 16790 states and 27899 transitions. [2025-01-09 14:50:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:50:08,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:08,758 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,768 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:50:08,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:08,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:08,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1841034794, now seen corresponding path program 1 times [2025-01-09 14:50:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:08,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596846558] [2025-01-09 14:50:08,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:08,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:08,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:09,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:09,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:09,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:50:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596846558] [2025-01-09 14:50:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596846558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:09,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:09,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:50:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742007109] [2025-01-09 14:50:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:09,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:50:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:09,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:50:09,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:50:09,688 INFO L87 Difference]: Start difference. First operand 16790 states and 27899 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 2 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65)