./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.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_fillercode_fillercodesize_ps-cn-500_file-9.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 8c719a907edd740487c94e158c335e04c63c8abfa905aa57ad8e2c1d74785261 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:09:24,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:09:24,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:09:24,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:09:24,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:09:24,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:09:24,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:09:24,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:09:24,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:09:24,598 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:09:24,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:09:24,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:09:24,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:09:24,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:09:24,599 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:09:24,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:09:24,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:09:24,599 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:09:24,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:09:24,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:09:24,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:09:24,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:09:24,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:09:24,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:09:24,600 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:09:24,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:09:24,600 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:09:24,601 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:09:24,601 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:09:24,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:09:24,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:09:24,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:09:24,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:24,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:24,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:09:24,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:09:24,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:09:24,603 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 -> 8c719a907edd740487c94e158c335e04c63c8abfa905aa57ad8e2c1d74785261 [2025-01-09 10:09:24,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:09:24,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:09:24,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:09:24,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:09:24,871 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:09:24,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.i [2025-01-09 10:09:26,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e5010979/b8f798625ecb4f7882fc42c7b2cca47a/FLAG70e57c688 [2025-01-09 10:09:26,383 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:09:26,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.i [2025-01-09 10:09:26,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e5010979/b8f798625ecb4f7882fc42c7b2cca47a/FLAG70e57c688 [2025-01-09 10:09:26,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e5010979/b8f798625ecb4f7882fc42c7b2cca47a [2025-01-09 10:09:26,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:09:26,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:09:26,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:09:26,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:09:26,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:09:26,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:26,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26, skipping insertion in model container [2025-01-09 10:09:26,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:26,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:09:26,574 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_fillercode_fillercodesize_ps-cn-500_file-9.i[915,928] [2025-01-09 10:09:26,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:09:26,750 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:09:26,759 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_fillercode_fillercodesize_ps-cn-500_file-9.i[915,928] [2025-01-09 10:09:26,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:09:26,848 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:09:26,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26 WrapperNode [2025-01-09 10:09:26,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:09:26,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:09:26,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:09:26,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:09:26,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:26,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:26,924 INFO L138 Inliner]: procedures = 26, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 795 [2025-01-09 10:09:26,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:09:26,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:09:26,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:09:26,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:09:26,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:26,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:26,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:26,972 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 10:09:26,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:26,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:26,993 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:26,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:27,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:27,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:27,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:27,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:09:27,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:09:27,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:09:27,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:09:27,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (1/1) ... [2025-01-09 10:09:27,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:27,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:27,070 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 10:09:27,073 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 10:09:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:09:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:09:27,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:09:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:09:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:09:27,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:09:27,209 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:09:27,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:09:28,296 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 10:09:28,296 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:09:28,312 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:09:28,315 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:09:28,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:09:28 BoogieIcfgContainer [2025-01-09 10:09:28,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:09:28,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:09:28,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:09:28,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:09:28,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:09:26" (1/3) ... [2025-01-09 10:09:28,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc59de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:09:28, skipping insertion in model container [2025-01-09 10:09:28,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:26" (2/3) ... [2025-01-09 10:09:28,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc59de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:09:28, skipping insertion in model container [2025-01-09 10:09:28,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:09:28" (3/3) ... [2025-01-09 10:09:28,325 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-9.i [2025-01-09 10:09:28,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:09:28,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-9.i that has 2 procedures, 336 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:09:28,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:09:28,414 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;@74d4fbf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:09:28,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:09:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 336 states, 244 states have (on average 1.6147540983606556) internal successors, (394), 245 states have internal predecessors, (394), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 10:09:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-09 10:09:28,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:28,449 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:28,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:28,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1523029428, now seen corresponding path program 1 times [2025-01-09 10:09:28,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:28,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546325927] [2025-01-09 10:09:28,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:28,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 10:09:28,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 10:09:28,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:28,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546325927] [2025-01-09 10:09:29,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546325927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:29,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:29,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48061860] [2025-01-09 10:09:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:29,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:29,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:29,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:29,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:29,291 INFO L87 Difference]: Start difference. First operand has 336 states, 244 states have (on average 1.6147540983606556) internal successors, (394), 245 states have internal predecessors, (394), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:29,441 INFO L93 Difference]: Finished difference Result 869 states and 1610 transitions. [2025-01-09 10:09:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:29,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 587 [2025-01-09 10:09:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:29,456 INFO L225 Difference]: With dead ends: 869 [2025-01-09 10:09:29,456 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 10:09:29,461 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 10:09:29,463 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 362 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:29,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1337 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 10:09:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2025-01-09 10:09:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 411 states have (on average 1.6277372262773722) internal successors, (669), 412 states have internal predecessors, (669), 119 states have call successors, (119), 2 states have call predecessors, (119), 2 states have return successors, (119), 118 states have call predecessors, (119), 119 states have call successors, (119) [2025-01-09 10:09:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 907 transitions. [2025-01-09 10:09:29,597 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 907 transitions. Word has length 587 [2025-01-09 10:09:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:29,601 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 907 transitions. [2025-01-09 10:09:29,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 907 transitions. [2025-01-09 10:09:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-09 10:09:29,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:29,613 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:29,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 10:09:29,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:29,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1447081674, now seen corresponding path program 1 times [2025-01-09 10:09:29,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:29,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561152179] [2025-01-09 10:09:29,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:29,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:29,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 10:09:29,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 10:09:29,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:29,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:30,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:30,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561152179] [2025-01-09 10:09:30,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561152179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:30,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:30,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757922614] [2025-01-09 10:09:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:30,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:30,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:30,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:30,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:30,113 INFO L87 Difference]: Start difference. First operand 533 states and 907 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:30,214 INFO L93 Difference]: Finished difference Result 1459 states and 2491 transitions. [2025-01-09 10:09:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:30,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 587 [2025-01-09 10:09:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:30,228 INFO L225 Difference]: With dead ends: 1459 [2025-01-09 10:09:30,228 INFO L226 Difference]: Without dead ends: 929 [2025-01-09 10:09:30,231 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 10:09:30,232 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 347 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:30,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1136 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-01-09 10:09:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 925. [2025-01-09 10:09:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 767 states have (on average 1.6636245110821382) internal successors, (1276), 770 states have internal predecessors, (1276), 153 states have call successors, (153), 4 states have call predecessors, (153), 4 states have return successors, (153), 150 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-09 10:09:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1582 transitions. [2025-01-09 10:09:30,330 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1582 transitions. Word has length 587 [2025-01-09 10:09:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:30,334 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1582 transitions. [2025-01-09 10:09:30,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1582 transitions. [2025-01-09 10:09:30,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-09 10:09:30,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:30,351 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:30,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:09:30,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:30,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:30,354 INFO L85 PathProgramCache]: Analyzing trace with hash -186164424, now seen corresponding path program 1 times [2025-01-09 10:09:30,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:30,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027166973] [2025-01-09 10:09:30,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:30,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:30,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 10:09:30,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 10:09:30,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:30,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:30,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:30,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027166973] [2025-01-09 10:09:30,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027166973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:30,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:30,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:30,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119020732] [2025-01-09 10:09:30,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:30,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:30,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:30,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:30,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:30,819 INFO L87 Difference]: Start difference. First operand 925 states and 1582 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:30,905 INFO L93 Difference]: Finished difference Result 2418 states and 4120 transitions. [2025-01-09 10:09:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 587 [2025-01-09 10:09:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:30,916 INFO L225 Difference]: With dead ends: 2418 [2025-01-09 10:09:30,916 INFO L226 Difference]: Without dead ends: 1496 [2025-01-09 10:09:30,920 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 10:09:30,921 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 338 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:30,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1135 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-01-09 10:09:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1490. [2025-01-09 10:09:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1268 states have (on average 1.660883280757098) internal successors, (2106), 1275 states have internal predecessors, (2106), 213 states have call successors, (213), 8 states have call predecessors, (213), 8 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2025-01-09 10:09:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2532 transitions. [2025-01-09 10:09:30,996 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2532 transitions. Word has length 587 [2025-01-09 10:09:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:30,997 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 2532 transitions. [2025-01-09 10:09:30,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2532 transitions. [2025-01-09 10:09:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-09 10:09:31,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:31,007 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:31,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:09:31,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:31,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1200620986, now seen corresponding path program 1 times [2025-01-09 10:09:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:31,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347387115] [2025-01-09 10:09:31,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:31,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 10:09:31,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 10:09:31,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:31,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:31,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347387115] [2025-01-09 10:09:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347387115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:31,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624827757] [2025-01-09 10:09:31,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:31,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:31,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:31,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:31,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:31,359 INFO L87 Difference]: Start difference. First operand 1490 states and 2532 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:31,406 INFO L93 Difference]: Finished difference Result 2985 states and 5077 transitions. [2025-01-09 10:09:31,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:31,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 587 [2025-01-09 10:09:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:31,417 INFO L225 Difference]: With dead ends: 2985 [2025-01-09 10:09:31,417 INFO L226 Difference]: Without dead ends: 1498 [2025-01-09 10:09:31,421 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 10:09:31,422 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:31,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-01-09 10:09:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1498. [2025-01-09 10:09:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1276 states have (on average 1.6567398119122256) internal successors, (2114), 1283 states have internal predecessors, (2114), 213 states have call successors, (213), 8 states have call predecessors, (213), 8 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2025-01-09 10:09:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 2540 transitions. [2025-01-09 10:09:31,488 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 2540 transitions. Word has length 587 [2025-01-09 10:09:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:31,489 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 2540 transitions. [2025-01-09 10:09:31,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 2540 transitions. [2025-01-09 10:09:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-01-09 10:09:31,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:31,495 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:31,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:09:31,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:31,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1372589687, now seen corresponding path program 1 times [2025-01-09 10:09:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:31,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885305889] [2025-01-09 10:09:31,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:31,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:31,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-01-09 10:09:31,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-01-09 10:09:31,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:31,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:31,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:31,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885305889] [2025-01-09 10:09:31,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885305889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:31,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:31,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:31,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667393912] [2025-01-09 10:09:31,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:31,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:31,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:31,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:31,777 INFO L87 Difference]: Start difference. First operand 1498 states and 2540 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:31,865 INFO L93 Difference]: Finished difference Result 3397 states and 5748 transitions. [2025-01-09 10:09:31,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:31,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 588 [2025-01-09 10:09:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:31,875 INFO L225 Difference]: With dead ends: 3397 [2025-01-09 10:09:31,876 INFO L226 Difference]: Without dead ends: 1902 [2025-01-09 10:09:31,879 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 10:09:31,880 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 347 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:31,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1128 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-01-09 10:09:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1029. [2025-01-09 10:09:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 867 states have (on average 1.6539792387543253) internal successors, (1434), 870 states have internal predecessors, (1434), 153 states have call successors, (153), 8 states have call predecessors, (153), 8 states have return successors, (153), 150 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-09 10:09:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1740 transitions. [2025-01-09 10:09:31,931 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1740 transitions. Word has length 588 [2025-01-09 10:09:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:31,931 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1740 transitions. [2025-01-09 10:09:31,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1740 transitions. [2025-01-09 10:09:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-01-09 10:09:31,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:31,937 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:31,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:09:31,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:31,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:31,938 INFO L85 PathProgramCache]: Analyzing trace with hash -930287211, now seen corresponding path program 1 times [2025-01-09 10:09:31,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:31,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318100139] [2025-01-09 10:09:31,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:31,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:31,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-01-09 10:09:32,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-01-09 10:09:32,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:32,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318100139] [2025-01-09 10:09:32,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318100139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:32,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:32,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386281259] [2025-01-09 10:09:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:32,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:32,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:32,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:32,610 INFO L87 Difference]: Start difference. First operand 1029 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:32,692 INFO L93 Difference]: Finished difference Result 3076 states and 5204 transitions. [2025-01-09 10:09:32,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:32,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 588 [2025-01-09 10:09:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:32,703 INFO L225 Difference]: With dead ends: 3076 [2025-01-09 10:09:32,703 INFO L226 Difference]: Without dead ends: 2050 [2025-01-09 10:09:32,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:32,707 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 345 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:32,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1102 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-01-09 10:09:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2048. [2025-01-09 10:09:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1725 states have (on average 1.6492753623188405) internal successors, (2845), 1731 states have internal predecessors, (2845), 306 states have call successors, (306), 16 states have call predecessors, (306), 16 states have return successors, (306), 300 states have call predecessors, (306), 306 states have call successors, (306) [2025-01-09 10:09:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3457 transitions. [2025-01-09 10:09:32,827 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3457 transitions. Word has length 588 [2025-01-09 10:09:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:32,828 INFO L471 AbstractCegarLoop]: Abstraction has 2048 states and 3457 transitions. [2025-01-09 10:09:32,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3457 transitions. [2025-01-09 10:09:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-01-09 10:09:32,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:32,834 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:32,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:09:32,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:32,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash 992940823, now seen corresponding path program 1 times [2025-01-09 10:09:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789027678] [2025-01-09 10:09:32,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:32,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:32,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-01-09 10:09:32,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-01-09 10:09:32,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:32,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:33,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:33,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789027678] [2025-01-09 10:09:33,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789027678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:33,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:33,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:33,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144341861] [2025-01-09 10:09:33,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:33,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:33,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:33,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:33,253 INFO L87 Difference]: Start difference. First operand 2048 states and 3457 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:33,819 INFO L93 Difference]: Finished difference Result 6115 states and 10105 transitions. [2025-01-09 10:09:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:09:33,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 588 [2025-01-09 10:09:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:33,845 INFO L225 Difference]: With dead ends: 6115 [2025-01-09 10:09:33,845 INFO L226 Difference]: Without dead ends: 4070 [2025-01-09 10:09:33,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:33,853 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 591 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:33,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1697 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:09:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4070 states. [2025-01-09 10:09:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4070 to 4062. [2025-01-09 10:09:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 3189 states have (on average 1.5644402634054562) internal successors, (4989), 3211 states have internal predecessors, (4989), 824 states have call successors, (824), 48 states have call predecessors, (824), 48 states have return successors, (824), 802 states have call predecessors, (824), 824 states have call successors, (824) [2025-01-09 10:09:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 6637 transitions. [2025-01-09 10:09:34,162 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 6637 transitions. Word has length 588 [2025-01-09 10:09:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:34,163 INFO L471 AbstractCegarLoop]: Abstraction has 4062 states and 6637 transitions. [2025-01-09 10:09:34,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 6637 transitions. [2025-01-09 10:09:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-01-09 10:09:34,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:34,173 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:34,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:09:34,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:34,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash -571097257, now seen corresponding path program 1 times [2025-01-09 10:09:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:34,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679547452] [2025-01-09 10:09:34,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:34,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-01-09 10:09:34,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-01-09 10:09:34,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:34,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679547452] [2025-01-09 10:09:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679547452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:09:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657255065] [2025-01-09 10:09:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:35,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:09:35,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:35,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:09:35,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:09:35,665 INFO L87 Difference]: Start difference. First operand 4062 states and 6637 transitions. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 10:09:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:41,147 INFO L93 Difference]: Finished difference Result 42952 states and 69897 transitions. [2025-01-09 10:09:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:09:41,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) Word has length 589 [2025-01-09 10:09:41,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:41,320 INFO L225 Difference]: With dead ends: 42952 [2025-01-09 10:09:41,320 INFO L226 Difference]: Without dead ends: 38893 [2025-01-09 10:09:41,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:09:41,352 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 4614 mSDsluCounter, 4363 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 1174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4614 SdHoareTripleChecker+Valid, 5615 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1174 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:41,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4614 Valid, 5615 Invalid, 3229 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1174 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 10:09:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38893 states. [2025-01-09 10:09:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38893 to 8282. [2025-01-09 10:09:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8282 states, 6537 states have (on average 1.5709040844424047) internal successors, (10269), 6581 states have internal predecessors, (10269), 1648 states have call successors, (1648), 96 states have call predecessors, (1648), 96 states have return successors, (1648), 1604 states have call predecessors, (1648), 1648 states have call successors, (1648) [2025-01-09 10:09:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8282 states to 8282 states and 13565 transitions. [2025-01-09 10:09:42,612 INFO L78 Accepts]: Start accepts. Automaton has 8282 states and 13565 transitions. Word has length 589 [2025-01-09 10:09:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:42,614 INFO L471 AbstractCegarLoop]: Abstraction has 8282 states and 13565 transitions. [2025-01-09 10:09:42,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 10:09:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8282 states and 13565 transitions. [2025-01-09 10:09:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-01-09 10:09:42,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:42,625 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:42,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:09:42,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:42,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1989765589, now seen corresponding path program 1 times [2025-01-09 10:09:42,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:42,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235332508] [2025-01-09 10:09:42,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:42,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:42,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-01-09 10:09:42,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-01-09 10:09:42,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:42,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:43,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:43,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235332508] [2025-01-09 10:09:43,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235332508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:43,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:43,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:09:43,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743861414] [2025-01-09 10:09:43,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:43,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:09:43,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:43,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:09:43,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:09:43,334 INFO L87 Difference]: Start difference. First operand 8282 states and 13565 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:44,056 INFO L93 Difference]: Finished difference Result 19554 states and 31799 transitions. [2025-01-09 10:09:44,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:09:44,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-01-09 10:09:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:44,102 INFO L225 Difference]: With dead ends: 19554 [2025-01-09 10:09:44,103 INFO L226 Difference]: Without dead ends: 11275 [2025-01-09 10:09:44,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:09:44,127 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 421 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:44,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 2146 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:09:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2025-01-09 10:09:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11248. [2025-01-09 10:09:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11248 states, 8953 states have (on average 1.5571316877024461) internal successors, (13941), 9022 states have internal predecessors, (13941), 2123 states have call successors, (2123), 171 states have call predecessors, (2123), 171 states have return successors, (2123), 2054 states have call predecessors, (2123), 2123 states have call successors, (2123) [2025-01-09 10:09:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11248 states to 11248 states and 18187 transitions. [2025-01-09 10:09:44,806 INFO L78 Accepts]: Start accepts. Automaton has 11248 states and 18187 transitions. Word has length 589 [2025-01-09 10:09:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:44,807 INFO L471 AbstractCegarLoop]: Abstraction has 11248 states and 18187 transitions. [2025-01-09 10:09:44,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 11248 states and 18187 transitions. [2025-01-09 10:09:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-01-09 10:09:44,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:44,821 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:44,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:09:44,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:44,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1092372311, now seen corresponding path program 1 times [2025-01-09 10:09:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:44,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677982290] [2025-01-09 10:09:44,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:44,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:44,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-01-09 10:09:45,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-01-09 10:09:45,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:45,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:45,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677982290] [2025-01-09 10:09:45,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677982290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:45,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:45,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:45,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289275089] [2025-01-09 10:09:45,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:45,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:45,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:45,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:45,658 INFO L87 Difference]: Start difference. First operand 11248 states and 18187 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:47,542 INFO L93 Difference]: Finished difference Result 43776 states and 70534 transitions. [2025-01-09 10:09:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:09:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-01-09 10:09:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:47,644 INFO L225 Difference]: With dead ends: 43776 [2025-01-09 10:09:47,645 INFO L226 Difference]: Without dead ends: 32573 [2025-01-09 10:09:47,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:09:47,676 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 1326 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:47,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 2505 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:09:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32573 states. [2025-01-09 10:09:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32573 to 13800. [2025-01-09 10:09:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13800 states, 11433 states have (on average 1.6073646461995976) internal successors, (18377), 11502 states have internal predecessors, (18377), 2193 states have call successors, (2193), 173 states have call predecessors, (2193), 173 states have return successors, (2193), 2124 states have call predecessors, (2193), 2193 states have call successors, (2193) [2025-01-09 10:09:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13800 states to 13800 states and 22763 transitions. [2025-01-09 10:09:48,728 INFO L78 Accepts]: Start accepts. Automaton has 13800 states and 22763 transitions. Word has length 589 [2025-01-09 10:09:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:48,729 INFO L471 AbstractCegarLoop]: Abstraction has 13800 states and 22763 transitions. [2025-01-09 10:09:48,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 13800 states and 22763 transitions. [2025-01-09 10:09:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-01-09 10:09:48,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:48,746 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:48,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:09:48,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:48,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash 582899221, now seen corresponding path program 1 times [2025-01-09 10:09:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:48,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948650415] [2025-01-09 10:09:48,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:48,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:48,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-01-09 10:09:48,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-01-09 10:09:48,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:48,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:09:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:49,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948650415] [2025-01-09 10:09:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948650415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:49,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:49,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:09:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949474320] [2025-01-09 10:09:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:49,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:09:49,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:49,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:09:49,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:09:49,976 INFO L87 Difference]: Start difference. First operand 13800 states and 22763 transitions. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:09:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:56,218 INFO L93 Difference]: Finished difference Result 103779 states and 170486 transitions. [2025-01-09 10:09:56,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:09:56,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-01-09 10:09:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:56,473 INFO L225 Difference]: With dead ends: 103779 [2025-01-09 10:09:56,473 INFO L226 Difference]: Without dead ends: 90140 [2025-01-09 10:09:56,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:09:56,520 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 3465 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3465 SdHoareTripleChecker+Valid, 2978 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:56,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3465 Valid, 2978 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:09:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90140 states. [2025-01-09 10:10:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90140 to 46741. [2025-01-09 10:10:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46741 states, 39692 states have (on average 1.6148846115086164) internal successors, (64098), 39953 states have internal predecessors, (64098), 6417 states have call successors, (6417), 631 states have call predecessors, (6417), 631 states have return successors, (6417), 6156 states have call predecessors, (6417), 6417 states have call successors, (6417) [2025-01-09 10:10:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46741 states to 46741 states and 76932 transitions. [2025-01-09 10:10:00,388 INFO L78 Accepts]: Start accepts. Automaton has 46741 states and 76932 transitions. Word has length 589 [2025-01-09 10:10:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:00,389 INFO L471 AbstractCegarLoop]: Abstraction has 46741 states and 76932 transitions. [2025-01-09 10:10:00,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:10:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 46741 states and 76932 transitions. [2025-01-09 10:10:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-01-09 10:10:00,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:00,440 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:00,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:10:00,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:00,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1843816471, now seen corresponding path program 1 times [2025-01-09 10:10:00,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:00,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75794194] [2025-01-09 10:10:00,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:00,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-01-09 10:10:00,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-01-09 10:10:00,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:00,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:10:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:01,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75794194] [2025-01-09 10:10:01,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75794194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:01,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:01,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:10:01,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241203443] [2025-01-09 10:10:01,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:01,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:10:01,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:01,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:10:01,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:10:01,481 INFO L87 Difference]: Start difference. First operand 46741 states and 76932 transitions. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:10:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:12,817 INFO L93 Difference]: Finished difference Result 226450 states and 372315 transitions. [2025-01-09 10:10:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:10:12,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-01-09 10:10:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:13,277 INFO L225 Difference]: With dead ends: 226450 [2025-01-09 10:10:13,277 INFO L226 Difference]: Without dead ends: 179878 [2025-01-09 10:10:13,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:10:13,373 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 2822 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2822 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:13,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2822 Valid, 2711 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 10:10:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179878 states. [2025-01-09 10:10:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179878 to 102570. [2025-01-09 10:10:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102570 states, 88065 states have (on average 1.6245841140066997) internal successors, (143069), 88610 states have internal predecessors, (143069), 13201 states have call successors, (13201), 1303 states have call predecessors, (13201), 1303 states have return successors, (13201), 12656 states have call predecessors, (13201), 13201 states have call successors, (13201) [2025-01-09 10:10:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102570 states to 102570 states and 169471 transitions. [2025-01-09 10:10:21,371 INFO L78 Accepts]: Start accepts. Automaton has 102570 states and 169471 transitions. Word has length 589 [2025-01-09 10:10:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:21,372 INFO L471 AbstractCegarLoop]: Abstraction has 102570 states and 169471 transitions. [2025-01-09 10:10:21,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 10:10:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 102570 states and 169471 transitions. [2025-01-09 10:10:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-01-09 10:10:21,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:21,451 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:21,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:10:21,452 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:21,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2084056217, now seen corresponding path program 1 times [2025-01-09 10:10:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186903687] [2025-01-09 10:10:21,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:21,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-01-09 10:10:21,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-01-09 10:10:21,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:21,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 10:10:21,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:21,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186903687] [2025-01-09 10:10:21,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186903687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:21,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:21,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:10:21,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601050263] [2025-01-09 10:10:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:21,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:10:21,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:21,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:10:21,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:21,994 INFO L87 Difference]: Start difference. First operand 102570 states and 169471 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89)