./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-69.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-69.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 10a5b91e206caf05061e8827c7f121f08b981a096162c865ff7d0b016f9308fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:07:15,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:07:15,919 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:07:15,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:07:15,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:07:15,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:07:15,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:07:15,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:07:15,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:07:15,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:07:15,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:07:15,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:07:15,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:07:15,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:07:15,952 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:07:15,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:07:15,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:07:15,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:07:15,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:07:15,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:07:15,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:07:15,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:07:15,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:07:15,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:07:15,953 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:07:15,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:15,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:15,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:07:15,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:07:15,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:07:15,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:07:15,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:07:15,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:07:15,955 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 -> 10a5b91e206caf05061e8827c7f121f08b981a096162c865ff7d0b016f9308fd [2025-01-09 10:07:16,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:07:16,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:07:16,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:07:16,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:07:16,170 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:07:16,171 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-69.i [2025-01-09 10:07:17,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd3351975/c5eb94d8a2bd4b42973d4f73378bd712/FLAGabe12869f [2025-01-09 10:07:17,739 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:07:17,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-69.i [2025-01-09 10:07:17,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd3351975/c5eb94d8a2bd4b42973d4f73378bd712/FLAGabe12869f [2025-01-09 10:07:17,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd3351975/c5eb94d8a2bd4b42973d4f73378bd712 [2025-01-09 10:07:17,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:07:17,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:07:17,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:07:17,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:07:17,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:07:17,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:17" (1/1) ... [2025-01-09 10:07:17,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9f0acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:17, skipping insertion in model container [2025-01-09 10:07:17,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:17" (1/1) ... [2025-01-09 10:07:18,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:07:18,142 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-69.i[916,929] [2025-01-09 10:07:18,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:07:18,304 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:07:18,319 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-69.i[916,929] [2025-01-09 10:07:18,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:07:18,406 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:07:18,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18 WrapperNode [2025-01-09 10:07:18,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:07:18,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:07:18,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:07:18,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:07:18,414 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:07:18" (1/1) ... [2025-01-09 10:07:18,433 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:07:18" (1/1) ... [2025-01-09 10:07:18,510 INFO L138 Inliner]: procedures = 26, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 832 [2025-01-09 10:07:18,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:07:18,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:07:18,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:07:18,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:07:18,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,588 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:07:18,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:07:18,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:07:18,675 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:07:18,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:07:18,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (1/1) ... [2025-01-09 10:07:18,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:18,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:07:18,708 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:07:18,718 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:07:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:07:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:07:18,738 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:07:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:07:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:07:18,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:07:18,886 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:07:18,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:07:19,924 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 10:07:19,925 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:07:19,936 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:07:19,937 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:07:19,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:19 BoogieIcfgContainer [2025-01-09 10:07:19,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:07:19,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:07:19,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:07:19,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:07:19,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:07:17" (1/3) ... [2025-01-09 10:07:19,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327bf2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:07:19, skipping insertion in model container [2025-01-09 10:07:19,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:18" (2/3) ... [2025-01-09 10:07:19,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327bf2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:07:19, skipping insertion in model container [2025-01-09 10:07:19,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:19" (3/3) ... [2025-01-09 10:07:19,945 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-69.i [2025-01-09 10:07:19,955 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:07:19,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-69.i that has 2 procedures, 349 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:07:20,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:07:20,031 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;@38a90fe9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:07:20,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:07:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 222 states have (on average 1.5675675675675675) internal successors, (348), 223 states have internal predecessors, (348), 124 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 10:07:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-01-09 10:07:20,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:20,071 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:20,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:20,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:20,077 INFO L85 PathProgramCache]: Analyzing trace with hash 871013193, now seen corresponding path program 1 times [2025-01-09 10:07:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:20,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117748423] [2025-01-09 10:07:20,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:20,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:20,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-01-09 10:07:20,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-01-09 10:07:20,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:20,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 30258 trivial. 0 not checked. [2025-01-09 10:07:20,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:20,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117748423] [2025-01-09 10:07:20,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117748423] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:07:20,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813617569] [2025-01-09 10:07:20,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:20,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:07:20,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:07:20,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:07:20,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:07:20,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-01-09 10:07:21,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-01-09 10:07:21,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:21,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:21,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1743 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:07:21,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:07:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 30258 trivial. 0 not checked. [2025-01-09 10:07:21,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:07:21,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813617569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:21,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:07:21,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:07:21,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413379962] [2025-01-09 10:07:21,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:21,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:07:21,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:21,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:07:21,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:07:21,315 INFO L87 Difference]: Start difference. First operand has 349 states, 222 states have (on average 1.5675675675675675) internal successors, (348), 223 states have internal predecessors, (348), 124 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 2 states have call successors, (124) [2025-01-09 10:07:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:21,387 INFO L93 Difference]: Finished difference Result 692 states and 1311 transitions. [2025-01-09 10:07:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:07:21,389 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 2 states have call successors, (124) Word has length 775 [2025-01-09 10:07:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:21,400 INFO L225 Difference]: With dead ends: 692 [2025-01-09 10:07:21,400 INFO L226 Difference]: Without dead ends: 346 [2025-01-09 10:07:21,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 776 GetRequests, 776 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:07:21,409 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:21,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:21,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-09 10:07:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-01-09 10:07:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 220 states have (on average 1.55) internal successors, (341), 220 states have internal predecessors, (341), 124 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 10:07:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 589 transitions. [2025-01-09 10:07:21,506 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 589 transitions. Word has length 775 [2025-01-09 10:07:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:21,506 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 589 transitions. [2025-01-09 10:07:21,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 2 states have call successors, (124) [2025-01-09 10:07:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 589 transitions. [2025-01-09 10:07:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-01-09 10:07:21,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:21,521 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:21,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:07:21,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:07:21,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:21,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:21,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1957262587, now seen corresponding path program 1 times [2025-01-09 10:07:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:21,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711447953] [2025-01-09 10:07:21,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:21,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-01-09 10:07:21,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-01-09 10:07:21,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:21,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:22,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:22,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711447953] [2025-01-09 10:07:22,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711447953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:22,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:22,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888756375] [2025-01-09 10:07:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:22,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:22,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:22,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:22,595 INFO L87 Difference]: Start difference. First operand 346 states and 589 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:22,716 INFO L93 Difference]: Finished difference Result 879 states and 1507 transitions. [2025-01-09 10:07:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:22,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 775 [2025-01-09 10:07:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:22,724 INFO L225 Difference]: With dead ends: 879 [2025-01-09 10:07:22,725 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 10:07:22,727 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:07:22,727 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 320 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:22,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1267 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:07:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 10:07:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2025-01-09 10:07:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 377 states have (on average 1.6047745358090186) internal successors, (605), 378 states have internal predecessors, (605), 153 states have call successors, (153), 2 states have call predecessors, (153), 2 states have return successors, (153), 152 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-09 10:07:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 911 transitions. [2025-01-09 10:07:22,804 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 911 transitions. Word has length 775 [2025-01-09 10:07:22,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:22,805 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 911 transitions. [2025-01-09 10:07:22,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 911 transitions. [2025-01-09 10:07:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-01-09 10:07:22,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:22,825 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:22,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:07:22,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:22,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash 458573763, now seen corresponding path program 1 times [2025-01-09 10:07:22,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:22,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772484591] [2025-01-09 10:07:22,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:22,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-01-09 10:07:22,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-01-09 10:07:22,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:22,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:23,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:23,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772484591] [2025-01-09 10:07:23,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772484591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:23,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:23,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:23,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259240015] [2025-01-09 10:07:23,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:23,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:23,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:23,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:23,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:23,237 INFO L87 Difference]: Start difference. First operand 533 states and 911 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:23,331 INFO L93 Difference]: Finished difference Result 1593 states and 2727 transitions. [2025-01-09 10:07:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:23,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 775 [2025-01-09 10:07:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:23,345 INFO L225 Difference]: With dead ends: 1593 [2025-01-09 10:07:23,345 INFO L226 Difference]: Without dead ends: 1063 [2025-01-09 10:07:23,347 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:07:23,349 INFO L435 NwaCegarLoop]: 1146 mSDtfsCounter, 580 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:23,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1715 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-01-09 10:07:23,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1060. [2025-01-09 10:07:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 749 states have (on average 1.60347129506008) internal successors, (1201), 751 states have internal predecessors, (1201), 306 states have call successors, (306), 4 states have call predecessors, (306), 4 states have return successors, (306), 304 states have call predecessors, (306), 306 states have call successors, (306) [2025-01-09 10:07:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1813 transitions. [2025-01-09 10:07:23,508 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1813 transitions. Word has length 775 [2025-01-09 10:07:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:23,509 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1813 transitions. [2025-01-09 10:07:23,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1813 transitions. [2025-01-09 10:07:23,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-01-09 10:07:23,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:23,515 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:23,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:07:23,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:23,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:23,516 INFO L85 PathProgramCache]: Analyzing trace with hash 485639365, now seen corresponding path program 1 times [2025-01-09 10:07:23,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:23,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741683821] [2025-01-09 10:07:23,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:23,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:23,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-01-09 10:07:23,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-01-09 10:07:23,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:23,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:23,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:23,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741683821] [2025-01-09 10:07:23,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741683821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:23,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:23,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076312330] [2025-01-09 10:07:23,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:23,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:23,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:23,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:23,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:23,889 INFO L87 Difference]: Start difference. First operand 1060 states and 1813 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:24,012 INFO L93 Difference]: Finished difference Result 2637 states and 4513 transitions. [2025-01-09 10:07:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:24,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 775 [2025-01-09 10:07:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:24,023 INFO L225 Difference]: With dead ends: 2637 [2025-01-09 10:07:24,023 INFO L226 Difference]: Without dead ends: 1580 [2025-01-09 10:07:24,027 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:07:24,028 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 369 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:24,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1376 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:07:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-01-09 10:07:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1577. [2025-01-09 10:07:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1111 states have (on average 1.5976597659765976) internal successors, (1775), 1114 states have internal predecessors, (1775), 459 states have call successors, (459), 6 states have call predecessors, (459), 6 states have return successors, (459), 456 states have call predecessors, (459), 459 states have call successors, (459) [2025-01-09 10:07:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2693 transitions. [2025-01-09 10:07:24,184 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2693 transitions. Word has length 775 [2025-01-09 10:07:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:24,185 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2693 transitions. [2025-01-09 10:07:24,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2693 transitions. [2025-01-09 10:07:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:07:24,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:24,194 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:24,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:07:24,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:24,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:24,195 INFO L85 PathProgramCache]: Analyzing trace with hash 657559872, now seen corresponding path program 1 times [2025-01-09 10:07:24,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:24,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191656692] [2025-01-09 10:07:24,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:24,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:24,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:07:24,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:07:24,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:24,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:24,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191656692] [2025-01-09 10:07:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191656692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:24,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:07:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451795486] [2025-01-09 10:07:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:24,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:07:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:24,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:07:24,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:24,547 INFO L87 Difference]: Start difference. First operand 1577 states and 2693 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:24,853 INFO L93 Difference]: Finished difference Result 4272 states and 7284 transitions. [2025-01-09 10:07:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:07:24,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 777 [2025-01-09 10:07:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:24,869 INFO L225 Difference]: With dead ends: 4272 [2025-01-09 10:07:24,869 INFO L226 Difference]: Without dead ends: 2698 [2025-01-09 10:07:24,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:07:24,875 INFO L435 NwaCegarLoop]: 1176 mSDtfsCounter, 732 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 2841 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:24,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 2841 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:07:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2025-01-09 10:07:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2140. [2025-01-09 10:07:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 1617 states have (on average 1.6221397649969078) internal successors, (2623), 1620 states have internal predecessors, (2623), 510 states have call successors, (510), 12 states have call predecessors, (510), 12 states have return successors, (510), 507 states have call predecessors, (510), 510 states have call successors, (510) [2025-01-09 10:07:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 3643 transitions. [2025-01-09 10:07:25,018 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 3643 transitions. Word has length 777 [2025-01-09 10:07:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:25,019 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 3643 transitions. [2025-01-09 10:07:25,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3643 transitions. [2025-01-09 10:07:25,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-01-09 10:07:25,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:25,026 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:25,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:07:25,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:25,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash -446976422, now seen corresponding path program 1 times [2025-01-09 10:07:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812136146] [2025-01-09 10:07:25,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:25,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:25,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-01-09 10:07:25,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-01-09 10:07:25,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:25,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:25,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:25,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812136146] [2025-01-09 10:07:25,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812136146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:25,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:25,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398054984] [2025-01-09 10:07:25,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:25,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:25,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:25,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:25,281 INFO L87 Difference]: Start difference. First operand 2140 states and 3643 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:25,414 INFO L93 Difference]: Finished difference Result 5677 states and 9648 transitions. [2025-01-09 10:07:25,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:25,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 778 [2025-01-09 10:07:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:25,432 INFO L225 Difference]: With dead ends: 5677 [2025-01-09 10:07:25,433 INFO L226 Difference]: Without dead ends: 3540 [2025-01-09 10:07:25,439 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:07:25,439 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 383 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:25,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1155 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3540 states. [2025-01-09 10:07:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3540 to 3535. [2025-01-09 10:07:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3535 states, 2586 states have (on average 1.602474864655839) internal successors, (4144), 2595 states have internal predecessors, (4144), 924 states have call successors, (924), 24 states have call predecessors, (924), 24 states have return successors, (924), 915 states have call predecessors, (924), 924 states have call successors, (924) [2025-01-09 10:07:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 5992 transitions. [2025-01-09 10:07:25,688 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 5992 transitions. Word has length 778 [2025-01-09 10:07:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:25,689 INFO L471 AbstractCegarLoop]: Abstraction has 3535 states and 5992 transitions. [2025-01-09 10:07:25,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 5992 transitions. [2025-01-09 10:07:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-01-09 10:07:25,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:25,696 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:25,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:07:25,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:25,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash -3075748, now seen corresponding path program 1 times [2025-01-09 10:07:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:25,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324806009] [2025-01-09 10:07:25,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:25,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-01-09 10:07:25,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-01-09 10:07:25,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:25,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:25,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324806009] [2025-01-09 10:07:25,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324806009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:25,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135174426] [2025-01-09 10:07:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:25,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:25,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:25,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:25,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:25,918 INFO L87 Difference]: Start difference. First operand 3535 states and 5992 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:26,274 INFO L93 Difference]: Finished difference Result 10557 states and 17886 transitions. [2025-01-09 10:07:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 778 [2025-01-09 10:07:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:26,324 INFO L225 Difference]: With dead ends: 10557 [2025-01-09 10:07:26,324 INFO L226 Difference]: Without dead ends: 7025 [2025-01-09 10:07:26,340 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:07:26,341 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 558 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:26,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1681 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2025-01-09 10:07:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 7023. [2025-01-09 10:07:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7023 states, 5126 states have (on average 1.5868123293015997) internal successors, (8134), 5144 states have internal predecessors, (8134), 1848 states have call successors, (1848), 48 states have call predecessors, (1848), 48 states have return successors, (1848), 1830 states have call predecessors, (1848), 1848 states have call successors, (1848) [2025-01-09 10:07:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 11830 transitions. [2025-01-09 10:07:26,932 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 11830 transitions. Word has length 778 [2025-01-09 10:07:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:26,933 INFO L471 AbstractCegarLoop]: Abstraction has 7023 states and 11830 transitions. [2025-01-09 10:07:26,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 11830 transitions. [2025-01-09 10:07:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-01-09 10:07:26,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:26,944 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:26,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:07:26,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:26,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1218971610, now seen corresponding path program 1 times [2025-01-09 10:07:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:26,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334324984] [2025-01-09 10:07:26,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:26,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:27,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-01-09 10:07:27,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-01-09 10:07:27,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:27,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:27,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334324984] [2025-01-09 10:07:27,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334324984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:27,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:27,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:27,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007835388] [2025-01-09 10:07:27,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:27,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:27,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:27,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:27,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:27,347 INFO L87 Difference]: Start difference. First operand 7023 states and 11830 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:27,761 INFO L93 Difference]: Finished difference Result 19445 states and 32706 transitions. [2025-01-09 10:07:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:27,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-01-09 10:07:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:27,950 INFO L225 Difference]: With dead ends: 19445 [2025-01-09 10:07:27,950 INFO L226 Difference]: Without dead ends: 12425 [2025-01-09 10:07:27,984 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:07:27,988 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 350 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:27,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1390 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12425 states. [2025-01-09 10:07:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12425 to 12411. [2025-01-09 10:07:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12411 states, 8858 states have (on average 1.5698803341612102) internal successors, (13906), 8900 states have internal predecessors, (13906), 3456 states have call successors, (3456), 96 states have call predecessors, (3456), 96 states have return successors, (3456), 3414 states have call predecessors, (3456), 3456 states have call successors, (3456) [2025-01-09 10:07:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12411 states to 12411 states and 20818 transitions. [2025-01-09 10:07:28,795 INFO L78 Accepts]: Start accepts. Automaton has 12411 states and 20818 transitions. Word has length 779 [2025-01-09 10:07:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:28,796 INFO L471 AbstractCegarLoop]: Abstraction has 12411 states and 20818 transitions. [2025-01-09 10:07:28,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 12411 states and 20818 transitions. [2025-01-09 10:07:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-01-09 10:07:28,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:28,810 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:28,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:07:28,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:28,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash 832012388, now seen corresponding path program 1 times [2025-01-09 10:07:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:28,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929921493] [2025-01-09 10:07:28,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:28,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-01-09 10:07:28,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-01-09 10:07:28,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:28,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929921493] [2025-01-09 10:07:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929921493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:29,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122473975] [2025-01-09 10:07:29,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:29,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:29,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:29,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:29,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:29,677 INFO L87 Difference]: Start difference. First operand 12411 states and 20818 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:30,706 INFO L93 Difference]: Finished difference Result 32739 states and 54964 transitions. [2025-01-09 10:07:30,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:30,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-01-09 10:07:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:30,792 INFO L225 Difference]: With dead ends: 32739 [2025-01-09 10:07:30,792 INFO L226 Difference]: Without dead ends: 24439 [2025-01-09 10:07:30,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:07:30,824 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 545 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:30,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1160 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:07:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24439 states. [2025-01-09 10:07:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24439 to 12423. [2025-01-09 10:07:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12423 states, 8870 states have (on average 1.5697857948139797) internal successors, (13924), 8912 states have internal predecessors, (13924), 3456 states have call successors, (3456), 96 states have call predecessors, (3456), 96 states have return successors, (3456), 3414 states have call predecessors, (3456), 3456 states have call successors, (3456) [2025-01-09 10:07:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12423 states to 12423 states and 20836 transitions. [2025-01-09 10:07:32,148 INFO L78 Accepts]: Start accepts. Automaton has 12423 states and 20836 transitions. Word has length 779 [2025-01-09 10:07:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:32,149 INFO L471 AbstractCegarLoop]: Abstraction has 12423 states and 20836 transitions. [2025-01-09 10:07:32,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 12423 states and 20836 transitions. [2025-01-09 10:07:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-01-09 10:07:32,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:32,162 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:32,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:07:32,163 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:32,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash -108545121, now seen corresponding path program 1 times [2025-01-09 10:07:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:32,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576491773] [2025-01-09 10:07:32,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:32,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-01-09 10:07:32,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-01-09 10:07:32,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:32,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576491773] [2025-01-09 10:07:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576491773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:32,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:32,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:07:32,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056385752] [2025-01-09 10:07:32,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:32,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:07:32,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:32,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:07:32,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:07:32,589 INFO L87 Difference]: Start difference. First operand 12423 states and 20836 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:33,435 INFO L93 Difference]: Finished difference Result 30644 states and 51816 transitions. [2025-01-09 10:07:33,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:07:33,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-01-09 10:07:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:33,490 INFO L225 Difference]: With dead ends: 30644 [2025-01-09 10:07:33,490 INFO L226 Difference]: Without dead ends: 18224 [2025-01-09 10:07:33,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:07:33,523 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 516 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:33,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 2330 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:07:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18224 states. [2025-01-09 10:07:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18224 to 17454. [2025-01-09 10:07:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17454 states, 13773 states have (on average 1.6390038481086182) internal successors, (22574), 13815 states have internal predecessors, (22574), 3580 states have call successors, (3580), 100 states have call predecessors, (3580), 100 states have return successors, (3580), 3538 states have call predecessors, (3580), 3580 states have call successors, (3580) [2025-01-09 10:07:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17454 states to 17454 states and 29734 transitions. [2025-01-09 10:07:34,302 INFO L78 Accepts]: Start accepts. Automaton has 17454 states and 29734 transitions. Word has length 779 [2025-01-09 10:07:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:34,303 INFO L471 AbstractCegarLoop]: Abstraction has 17454 states and 29734 transitions. [2025-01-09 10:07:34,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 17454 states and 29734 transitions. [2025-01-09 10:07:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-01-09 10:07:34,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:34,380 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:34,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:07:34,380 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:34,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash 478260893, now seen corresponding path program 1 times [2025-01-09 10:07:34,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:34,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354743543] [2025-01-09 10:07:34,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:34,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:34,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-01-09 10:07:34,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-01-09 10:07:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:34,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:34,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354743543] [2025-01-09 10:07:34,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354743543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:34,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:34,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:07:34,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460707871] [2025-01-09 10:07:34,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:34,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:07:34,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:34,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:07:34,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:34,737 INFO L87 Difference]: Start difference. First operand 17454 states and 29734 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:35,759 INFO L93 Difference]: Finished difference Result 49016 states and 83699 transitions. [2025-01-09 10:07:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:07:35,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-01-09 10:07:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:35,874 INFO L225 Difference]: With dead ends: 49016 [2025-01-09 10:07:35,875 INFO L226 Difference]: Without dead ends: 31784 [2025-01-09 10:07:35,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:35,921 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 346 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:35,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1634 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:07:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31784 states. [2025-01-09 10:07:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31784 to 31734. [2025-01-09 10:07:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31734 states, 26372 states have (on average 1.665592294858183) internal successors, (43925), 26462 states have internal predecessors, (43925), 5164 states have call successors, (5164), 197 states have call predecessors, (5164), 197 states have return successors, (5164), 5074 states have call predecessors, (5164), 5164 states have call successors, (5164) [2025-01-09 10:07:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31734 states to 31734 states and 54253 transitions. [2025-01-09 10:07:37,261 INFO L78 Accepts]: Start accepts. Automaton has 31734 states and 54253 transitions. Word has length 779 [2025-01-09 10:07:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:37,264 INFO L471 AbstractCegarLoop]: Abstraction has 31734 states and 54253 transitions. [2025-01-09 10:07:37,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 31734 states and 54253 transitions. [2025-01-09 10:07:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-01-09 10:07:37,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:37,287 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:07:37,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:37,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1940223585, now seen corresponding path program 1 times [2025-01-09 10:07:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:37,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129366668] [2025-01-09 10:07:37,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:37,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-01-09 10:07:37,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-01-09 10:07:37,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:37,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:37,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:37,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129366668] [2025-01-09 10:07:37,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129366668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:37,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:37,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297082030] [2025-01-09 10:07:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:37,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:37,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:37,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:37,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:37,731 INFO L87 Difference]: Start difference. First operand 31734 states and 54253 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:39,268 INFO L93 Difference]: Finished difference Result 88342 states and 150647 transitions. [2025-01-09 10:07:39,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:39,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-01-09 10:07:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:39,480 INFO L225 Difference]: With dead ends: 88342 [2025-01-09 10:07:39,481 INFO L226 Difference]: Without dead ends: 62318 [2025-01-09 10:07:39,544 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:07:39,545 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 344 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:39,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1256 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62318 states. [2025-01-09 10:07:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62318 to 62316. [2025-01-09 10:07:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62316 states, 51722 states have (on average 1.659429256409265) internal successors, (85829), 51902 states have internal predecessors, (85829), 10204 states have call successors, (10204), 389 states have call predecessors, (10204), 389 states have return successors, (10204), 10024 states have call predecessors, (10204), 10204 states have call successors, (10204) [2025-01-09 10:07:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62316 states to 62316 states and 106237 transitions. [2025-01-09 10:07:42,178 INFO L78 Accepts]: Start accepts. Automaton has 62316 states and 106237 transitions. Word has length 779 [2025-01-09 10:07:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:42,179 INFO L471 AbstractCegarLoop]: Abstraction has 62316 states and 106237 transitions. [2025-01-09 10:07:42,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 62316 states and 106237 transitions. [2025-01-09 10:07:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-01-09 10:07:42,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:42,216 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:42,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:07:42,217 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:42,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:42,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1675471457, now seen corresponding path program 1 times [2025-01-09 10:07:42,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:42,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117439413] [2025-01-09 10:07:42,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:42,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:42,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-01-09 10:07:42,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-01-09 10:07:42,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:42,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:07:45,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:45,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117439413] [2025-01-09 10:07:45,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117439413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:45,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:45,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:07:45,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410462244] [2025-01-09 10:07:45,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:45,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:07:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:45,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:07:45,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:07:45,837 INFO L87 Difference]: Start difference. First operand 62316 states and 106237 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:07:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:54,156 INFO L93 Difference]: Finished difference Result 256956 states and 433809 transitions. [2025-01-09 10:07:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:07:54,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 779 [2025-01-09 10:07:54,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:54,804 INFO L225 Difference]: With dead ends: 256956 [2025-01-09 10:07:54,804 INFO L226 Difference]: Without dead ends: 212814 [2025-01-09 10:07:54,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:07:54,963 INFO L435 NwaCegarLoop]: 1171 mSDtfsCounter, 2179 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2179 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:54,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2179 Valid, 3404 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 10:07:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212814 states. [2025-01-09 10:08:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212814 to 170508. [2025-01-09 10:08:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170508 states, 141322 states have (on average 1.650365831222315) internal successors, (233233), 141974 states have internal predecessors, (233233), 27836 states have call successors, (27836), 1349 states have call predecessors, (27836), 1349 states have return successors, (27836), 27184 states have call predecessors, (27836), 27836 states have call successors, (27836) [2025-01-09 10:08:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170508 states to 170508 states and 288905 transitions. [2025-01-09 10:08:04,144 INFO L78 Accepts]: Start accepts. Automaton has 170508 states and 288905 transitions. Word has length 779 [2025-01-09 10:08:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:04,146 INFO L471 AbstractCegarLoop]: Abstraction has 170508 states and 288905 transitions. [2025-01-09 10:08:04,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-01-09 10:08:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 170508 states and 288905 transitions. [2025-01-09 10:08:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-01-09 10:08:04,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:04,236 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:04,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:08:04,237 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:04,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash -818020561, now seen corresponding path program 1 times [2025-01-09 10:08:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:04,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467237653] [2025-01-09 10:08:04,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:04,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:04,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-01-09 10:08:04,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-01-09 10:08:04,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:04,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2025-01-09 10:08:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467237653] [2025-01-09 10:08:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467237653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:09,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:09,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:08:09,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126638689] [2025-01-09 10:08:09,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:09,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:08:09,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:09,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:08:09,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:09,745 INFO L87 Difference]: Start difference. First operand 170508 states and 288905 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 2 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 2 states have call predecessors, (124), 2 states have call successors, (124)