./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-46.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-46.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 ce8bf6dec5b27745c6bfb98fc715d507cc2238369c7f83c0b6f0bf89b9d57526 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:05:15,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:05:15,944 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:05:15,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:05:15,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:05:15,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:05:15,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:05:15,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:05:15,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:05:15,975 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:05:15,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:05:15,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:05:15,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:05:15,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:05:15,975 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:05:15,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:05:15,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:05:15,977 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:05:15,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:05:15,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:05:15,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:05:15,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:05:15,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:05:15,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:05:15,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:05:15,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:05:15,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:05:15,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:05:15,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:05:15,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:05:15,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:05:15,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:05:15,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:05:15,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:05:15,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:05:15,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:05:15,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:05:15,978 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 -> ce8bf6dec5b27745c6bfb98fc715d507cc2238369c7f83c0b6f0bf89b9d57526 [2025-01-09 10:05:16,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:05:16,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:05:16,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:05:16,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:05:16,201 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:05:16,202 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-46.i [2025-01-09 10:05:16,718 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62ee29073/865de9b859bb431e89f2b784787debff/FLAGdf63b3485 [2025-01-09 10:05:18,478 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:05:18,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-46.i [2025-01-09 10:05:18,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62ee29073/865de9b859bb431e89f2b784787debff/FLAGdf63b3485 [2025-01-09 10:05:18,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62ee29073/865de9b859bb431e89f2b784787debff [2025-01-09 10:05:18,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:05:18,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:05:18,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:05:18,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:05:18,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:05:18,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:18,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf8282c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18, skipping insertion in model container [2025-01-09 10:05:18,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:18,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:05:18,688 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-46.i[916,929] [2025-01-09 10:05:18,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:05:18,868 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:05:18,879 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-46.i[916,929] [2025-01-09 10:05:18,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:05:18,977 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:05:18,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18 WrapperNode [2025-01-09 10:05:18,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:05:18,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:05:18,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:05:18,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:05:18,984 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:05:18" (1/1) ... [2025-01-09 10:05:19,007 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:05:18" (1/1) ... [2025-01-09 10:05:19,082 INFO L138 Inliner]: procedures = 26, calls = 115, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 845 [2025-01-09 10:05:19,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:05:19,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:05:19,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:05:19,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:05:19,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,142 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:05:19,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:05:19,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:05:19,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:05:19,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:05:19,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (1/1) ... [2025-01-09 10:05:19,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:05:19,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:19,281 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:05:19,287 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:05:19,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:05:19,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:05:19,303 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:05:19,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:05:19,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:05:19,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:05:19,431 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:05:19,433 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:05:20,582 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 10:05:20,582 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:05:20,603 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:05:20,603 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:05:20,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:05:20 BoogieIcfgContainer [2025-01-09 10:05:20,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:05:20,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:05:20,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:05:20,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:05:20,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:05:18" (1/3) ... [2025-01-09 10:05:20,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a4f929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:05:20, skipping insertion in model container [2025-01-09 10:05:20,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:18" (2/3) ... [2025-01-09 10:05:20,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a4f929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:05:20, skipping insertion in model container [2025-01-09 10:05:20,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:05:20" (3/3) ... [2025-01-09 10:05:20,616 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-46.i [2025-01-09 10:05:20,631 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:05:20,634 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-46.i that has 2 procedures, 345 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:05:20,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:05:20,709 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;@cc7b522, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:05:20,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:05:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 345 states, 240 states have (on average 1.5875) internal successors, (381), 241 states have internal predecessors, (381), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:05:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-01-09 10:05:20,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:20,745 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:20,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:20,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1445262439, now seen corresponding path program 1 times [2025-01-09 10:05:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:20,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085948895] [2025-01-09 10:05:20,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:20,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:20,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-01-09 10:05:20,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-01-09 10:05:20,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:20,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-01-09 10:05:21,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:21,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085948895] [2025-01-09 10:05:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085948895] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:05:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660799532] [2025-01-09 10:05:21,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:21,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:21,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:21,316 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:05:21,317 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:05:21,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-01-09 10:05:21,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-01-09 10:05:21,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:21,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:21,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 1503 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:05:21,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-01-09 10:05:21,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:05:21,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660799532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:21,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:05:21,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:05:21,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400768023] [2025-01-09 10:05:21,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:21,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:05:21,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:21,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:05:21,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:05:21,769 INFO L87 Difference]: Start difference. First operand has 345 states, 240 states have (on average 1.5875) internal successors, (381), 241 states have internal predecessors, (381), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-01-09 10:05:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:21,828 INFO L93 Difference]: Finished difference Result 684 states and 1267 transitions. [2025-01-09 10:05:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:05:21,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) Word has length 658 [2025-01-09 10:05:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:21,839 INFO L225 Difference]: With dead ends: 684 [2025-01-09 10:05:21,839 INFO L226 Difference]: Without dead ends: 342 [2025-01-09 10:05:21,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 659 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:05:21,858 INFO L435 NwaCegarLoop]: 574 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, 574 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:05:21,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-01-09 10:05:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-01-09 10:05:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 238 states have (on average 1.5546218487394958) internal successors, (370), 238 states have internal predecessors, (370), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:05:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 574 transitions. [2025-01-09 10:05:21,925 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 574 transitions. Word has length 658 [2025-01-09 10:05:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:21,925 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 574 transitions. [2025-01-09 10:05:21,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-01-09 10:05:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 574 transitions. [2025-01-09 10:05:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-01-09 10:05:21,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:21,951 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:21,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:05:22,152 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:05:22,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:22,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:22,154 INFO L85 PathProgramCache]: Analyzing trace with hash 119256822, now seen corresponding path program 1 times [2025-01-09 10:05:22,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:22,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117932550] [2025-01-09 10:05:22,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:22,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:22,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-01-09 10:05:22,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-01-09 10:05:22,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:22,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:22,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117932550] [2025-01-09 10:05:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117932550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:22,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:22,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:22,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554726480] [2025-01-09 10:05:22,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:22,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:22,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:22,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:22,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:22,893 INFO L87 Difference]: Start difference. First operand 342 states and 574 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:23,037 INFO L93 Difference]: Finished difference Result 865 states and 1459 transitions. [2025-01-09 10:05:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:23,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 659 [2025-01-09 10:05:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:23,047 INFO L225 Difference]: With dead ends: 865 [2025-01-09 10:05:23,047 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 10:05:23,048 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:05:23,049 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 308 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:23,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1172 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:05:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 10:05:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2025-01-09 10:05:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 387 states have (on average 1.599483204134367) internal successors, (619), 388 states have internal predecessors, (619), 133 states have call successors, (133), 2 states have call predecessors, (133), 2 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 10:05:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 885 transitions. [2025-01-09 10:05:23,105 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 885 transitions. Word has length 659 [2025-01-09 10:05:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:23,106 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 885 transitions. [2025-01-09 10:05:23,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 885 transitions. [2025-01-09 10:05:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 10:05:23,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:23,122 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:23,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:05:23,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:23,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 249367982, now seen corresponding path program 1 times [2025-01-09 10:05:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:23,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916509779] [2025-01-09 10:05:23,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:23,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 10:05:23,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 10:05:23,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:23,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:23,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916509779] [2025-01-09 10:05:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916509779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:23,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247179748] [2025-01-09 10:05:23,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:23,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:23,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:23,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:23,437 INFO L87 Difference]: Start difference. First operand 523 states and 885 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:23,533 INFO L93 Difference]: Finished difference Result 1398 states and 2369 transitions. [2025-01-09 10:05:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:23,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 661 [2025-01-09 10:05:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:23,545 INFO L225 Difference]: With dead ends: 1398 [2025-01-09 10:05:23,545 INFO L226 Difference]: Without dead ends: 878 [2025-01-09 10:05:23,574 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:05:23,577 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 317 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:23,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1251 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-01-09 10:05:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 874. [2025-01-09 10:05:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 694 states have (on average 1.6181556195965419) internal successors, (1123), 697 states have internal predecessors, (1123), 175 states have call successors, (175), 4 states have call predecessors, (175), 4 states have return successors, (175), 172 states have call predecessors, (175), 175 states have call successors, (175) [2025-01-09 10:05:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1473 transitions. [2025-01-09 10:05:23,636 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1473 transitions. Word has length 661 [2025-01-09 10:05:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:23,639 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1473 transitions. [2025-01-09 10:05:23,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1473 transitions. [2025-01-09 10:05:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 10:05:23,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:23,648 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:23,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:05:23,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:23,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash 365857262, now seen corresponding path program 1 times [2025-01-09 10:05:23,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:23,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35920572] [2025-01-09 10:05:23,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:23,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:23,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 10:05:23,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 10:05:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:24,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:24,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35920572] [2025-01-09 10:05:24,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35920572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:24,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:24,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:24,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595873076] [2025-01-09 10:05:24,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:24,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:24,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:24,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:24,061 INFO L87 Difference]: Start difference. First operand 874 states and 1473 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:24,127 INFO L93 Difference]: Finished difference Result 1747 states and 2947 transitions. [2025-01-09 10:05:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:24,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 661 [2025-01-09 10:05:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:24,133 INFO L225 Difference]: With dead ends: 1747 [2025-01-09 10:05:24,133 INFO L226 Difference]: Without dead ends: 876 [2025-01-09 10:05:24,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:24,136 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:24,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1119 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-01-09 10:05:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2025-01-09 10:05:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 696 states have (on average 1.6163793103448276) internal successors, (1125), 699 states have internal predecessors, (1125), 175 states have call successors, (175), 4 states have call predecessors, (175), 4 states have return successors, (175), 172 states have call predecessors, (175), 175 states have call successors, (175) [2025-01-09 10:05:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1475 transitions. [2025-01-09 10:05:24,194 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1475 transitions. Word has length 661 [2025-01-09 10:05:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:24,196 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1475 transitions. [2025-01-09 10:05:24,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1475 transitions. [2025-01-09 10:05:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:24,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:24,202 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:24,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:05:24,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:24,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1566189500, now seen corresponding path program 1 times [2025-01-09 10:05:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:24,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235213632] [2025-01-09 10:05:24,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:24,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:24,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:24,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:24,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:24,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:24,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235213632] [2025-01-09 10:05:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235213632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:24,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:24,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:05:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22264986] [2025-01-09 10:05:24,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:24,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:05:24,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:24,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:05:24,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:05:24,984 INFO L87 Difference]: Start difference. First operand 876 states and 1475 transitions. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:25,826 INFO L93 Difference]: Finished difference Result 4279 states and 7219 transitions. [2025-01-09 10:05:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:05:25,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:25,850 INFO L225 Difference]: With dead ends: 4279 [2025-01-09 10:05:25,850 INFO L226 Difference]: Without dead ends: 3406 [2025-01-09 10:05:25,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:05:25,857 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 1923 mSDsluCounter, 3123 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 3724 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:25,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 3724 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:05:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2025-01-09 10:05:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 1754. [2025-01-09 10:05:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1494 states have (on average 1.6713520749665327) internal successors, (2497), 1501 states have internal predecessors, (2497), 251 states have call successors, (251), 8 states have call predecessors, (251), 8 states have return successors, (251), 244 states have call predecessors, (251), 251 states have call successors, (251) [2025-01-09 10:05:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2999 transitions. [2025-01-09 10:05:26,028 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2999 transitions. Word has length 662 [2025-01-09 10:05:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:26,030 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2999 transitions. [2025-01-09 10:05:26,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2999 transitions. [2025-01-09 10:05:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:26,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:26,043 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:26,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:05:26,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:26,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:26,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2010090174, now seen corresponding path program 1 times [2025-01-09 10:05:26,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:26,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035782192] [2025-01-09 10:05:26,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:26,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:26,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:26,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:26,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:26,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:26,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:26,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035782192] [2025-01-09 10:05:26,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035782192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:26,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:26,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565765913] [2025-01-09 10:05:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:26,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:26,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:26,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:26,481 INFO L87 Difference]: Start difference. First operand 1754 states and 2999 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:26,657 INFO L93 Difference]: Finished difference Result 4819 states and 8216 transitions. [2025-01-09 10:05:26,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:26,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:26,675 INFO L225 Difference]: With dead ends: 4819 [2025-01-09 10:05:26,676 INFO L226 Difference]: Without dead ends: 3068 [2025-01-09 10:05:26,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:26,682 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 366 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:26,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1353 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:05:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-01-09 10:05:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3010. [2025-01-09 10:05:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 2566 states have (on average 1.6582229150428682) internal successors, (4255), 2581 states have internal predecessors, (4255), 427 states have call successors, (427), 16 states have call predecessors, (427), 16 states have return successors, (427), 412 states have call predecessors, (427), 427 states have call successors, (427) [2025-01-09 10:05:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 5109 transitions. [2025-01-09 10:05:26,850 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 5109 transitions. Word has length 662 [2025-01-09 10:05:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:26,851 INFO L471 AbstractCegarLoop]: Abstraction has 3010 states and 5109 transitions. [2025-01-09 10:05:26,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 5109 transitions. [2025-01-09 10:05:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:26,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:26,859 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:26,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:05:26,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:26,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1806429246, now seen corresponding path program 1 times [2025-01-09 10:05:26,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:26,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150087147] [2025-01-09 10:05:26,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:26,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:26,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:26,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:26,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:26,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:27,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:27,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150087147] [2025-01-09 10:05:27,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150087147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:27,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:27,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:27,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557111128] [2025-01-09 10:05:27,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:27,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:27,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:27,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:27,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:27,199 INFO L87 Difference]: Start difference. First operand 3010 states and 5109 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:27,414 INFO L93 Difference]: Finished difference Result 7418 states and 12595 transitions. [2025-01-09 10:05:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:27,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:27,439 INFO L225 Difference]: With dead ends: 7418 [2025-01-09 10:05:27,439 INFO L226 Difference]: Without dead ends: 4411 [2025-01-09 10:05:27,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:27,446 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 309 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:27,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1101 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:05:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4411 states. [2025-01-09 10:05:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4411 to 3006. [2025-01-09 10:05:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3006 states, 2562 states have (on average 1.654566744730679) internal successors, (4239), 2577 states have internal predecessors, (4239), 427 states have call successors, (427), 16 states have call predecessors, (427), 16 states have return successors, (427), 412 states have call predecessors, (427), 427 states have call successors, (427) [2025-01-09 10:05:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 5093 transitions. [2025-01-09 10:05:27,606 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 5093 transitions. Word has length 662 [2025-01-09 10:05:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:27,607 INFO L471 AbstractCegarLoop]: Abstraction has 3006 states and 5093 transitions. [2025-01-09 10:05:27,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 5093 transitions. [2025-01-09 10:05:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:27,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:27,615 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:27,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:05:27,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:27,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2044637376, now seen corresponding path program 1 times [2025-01-09 10:05:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:27,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232822668] [2025-01-09 10:05:27,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:27,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:27,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:27,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:27,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:27,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:27,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232822668] [2025-01-09 10:05:27,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232822668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:27,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:27,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:05:27,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341727834] [2025-01-09 10:05:27,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:27,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:05:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:27,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:05:27,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:05:27,955 INFO L87 Difference]: Start difference. First operand 3006 states and 5093 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:28,135 INFO L93 Difference]: Finished difference Result 6033 states and 10219 transitions. [2025-01-09 10:05:28,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:05:28,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:28,150 INFO L225 Difference]: With dead ends: 6033 [2025-01-09 10:05:28,151 INFO L226 Difference]: Without dead ends: 3030 [2025-01-09 10:05:28,156 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:05:28,157 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 5 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:28,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1668 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2025-01-09 10:05:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3014. [2025-01-09 10:05:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 2570 states have (on average 1.6540856031128404) internal successors, (4251), 2585 states have internal predecessors, (4251), 427 states have call successors, (427), 16 states have call predecessors, (427), 16 states have return successors, (427), 412 states have call predecessors, (427), 427 states have call successors, (427) [2025-01-09 10:05:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 5105 transitions. [2025-01-09 10:05:28,296 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 5105 transitions. Word has length 662 [2025-01-09 10:05:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:28,297 INFO L471 AbstractCegarLoop]: Abstraction has 3014 states and 5105 transitions. [2025-01-09 10:05:28,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 5105 transitions. [2025-01-09 10:05:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:28,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:28,309 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:28,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:05:28,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:28,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash 291755134, now seen corresponding path program 1 times [2025-01-09 10:05:28,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:28,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972003833] [2025-01-09 10:05:28,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:28,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:28,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:28,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:28,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:28,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972003833] [2025-01-09 10:05:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972003833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:28,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:28,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:05:28,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279788413] [2025-01-09 10:05:28,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:28,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:05:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:28,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:05:28,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:05:28,814 INFO L87 Difference]: Start difference. First operand 3014 states and 5105 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:29,449 INFO L93 Difference]: Finished difference Result 12050 states and 20151 transitions. [2025-01-09 10:05:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:05:29,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:29,486 INFO L225 Difference]: With dead ends: 12050 [2025-01-09 10:05:29,487 INFO L226 Difference]: Without dead ends: 9039 [2025-01-09 10:05:29,493 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:05:29,494 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 981 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:29,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 3150 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:05:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9039 states. [2025-01-09 10:05:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9039 to 9031. [2025-01-09 10:05:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9031 states, 7314 states have (on average 1.6029532403609517) internal successors, (11724), 7376 states have internal predecessors, (11724), 1652 states have call successors, (1652), 64 states have call predecessors, (1652), 64 states have return successors, (1652), 1590 states have call predecessors, (1652), 1652 states have call successors, (1652) [2025-01-09 10:05:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 15028 transitions. [2025-01-09 10:05:29,990 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 15028 transitions. Word has length 662 [2025-01-09 10:05:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:29,991 INFO L471 AbstractCegarLoop]: Abstraction has 9031 states and 15028 transitions. [2025-01-09 10:05:29,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 15028 transitions. [2025-01-09 10:05:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:30,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:30,001 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:30,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:05:30,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:30,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash 715401856, now seen corresponding path program 1 times [2025-01-09 10:05:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669048394] [2025-01-09 10:05:30,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:30,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:30,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:30,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:30,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:30,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669048394] [2025-01-09 10:05:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669048394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:30,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706947305] [2025-01-09 10:05:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:30,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:30,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:30,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:30,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:30,498 INFO L87 Difference]: Start difference. First operand 9031 states and 15028 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:31,275 INFO L93 Difference]: Finished difference Result 27087 states and 45078 transitions. [2025-01-09 10:05:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:31,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:31,347 INFO L225 Difference]: With dead ends: 27087 [2025-01-09 10:05:31,348 INFO L226 Difference]: Without dead ends: 18059 [2025-01-09 10:05:31,377 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:05:31,378 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 343 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:31,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1139 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18059 states. [2025-01-09 10:05:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18059 to 18057. [2025-01-09 10:05:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18057 states, 14624 states have (on average 1.598741794310722) internal successors, (23380), 14748 states have internal predecessors, (23380), 3304 states have call successors, (3304), 128 states have call predecessors, (3304), 128 states have return successors, (3304), 3180 states have call predecessors, (3304), 3304 states have call successors, (3304) [2025-01-09 10:05:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18057 states to 18057 states and 29988 transitions. [2025-01-09 10:05:32,419 INFO L78 Accepts]: Start accepts. Automaton has 18057 states and 29988 transitions. Word has length 662 [2025-01-09 10:05:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:32,420 INFO L471 AbstractCegarLoop]: Abstraction has 18057 states and 29988 transitions. [2025-01-09 10:05:32,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18057 states and 29988 transitions. [2025-01-09 10:05:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:32,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:32,438 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:32,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:05:32,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:32,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:32,439 INFO L85 PathProgramCache]: Analyzing trace with hash 777441470, now seen corresponding path program 1 times [2025-01-09 10:05:32,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:32,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834735444] [2025-01-09 10:05:32,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:32,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:32,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:32,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:32,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:32,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:32,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834735444] [2025-01-09 10:05:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834735444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:32,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:32,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:05:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861483494] [2025-01-09 10:05:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:32,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:05:32,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:32,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:05:32,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:05:32,981 INFO L87 Difference]: Start difference. First operand 18057 states and 29988 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:35,152 INFO L93 Difference]: Finished difference Result 68523 states and 113687 transitions. [2025-01-09 10:05:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:05:35,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:35,362 INFO L225 Difference]: With dead ends: 68523 [2025-01-09 10:05:35,362 INFO L226 Difference]: Without dead ends: 50469 [2025-01-09 10:05:35,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:05:35,438 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 677 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:35,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 1647 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:05:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50469 states. [2025-01-09 10:05:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50469 to 35849. [2025-01-09 10:05:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35849 states, 29360 states have (on average 1.6036784741144414) internal successors, (47084), 29612 states have internal predecessors, (47084), 6232 states have call successors, (6232), 256 states have call predecessors, (6232), 256 states have return successors, (6232), 5980 states have call predecessors, (6232), 6232 states have call successors, (6232) [2025-01-09 10:05:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35849 states to 35849 states and 59548 transitions. [2025-01-09 10:05:37,510 INFO L78 Accepts]: Start accepts. Automaton has 35849 states and 59548 transitions. Word has length 662 [2025-01-09 10:05:37,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:37,511 INFO L471 AbstractCegarLoop]: Abstraction has 35849 states and 59548 transitions. [2025-01-09 10:05:37,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 35849 states and 59548 transitions. [2025-01-09 10:05:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:05:37,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:37,540 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:37,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:05:37,540 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:37,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash -859587187, now seen corresponding path program 1 times [2025-01-09 10:05:37,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:37,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822750128] [2025-01-09 10:05:37,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:37,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:37,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:05:37,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:05:37,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:37,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:37,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:37,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822750128] [2025-01-09 10:05:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822750128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435857111] [2025-01-09 10:05:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:37,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:37,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:37,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:37,994 INFO L87 Difference]: Start difference. First operand 35849 states and 59548 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:39,291 INFO L93 Difference]: Finished difference Result 70905 states and 117758 transitions. [2025-01-09 10:05:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:39,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-01-09 10:05:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:39,432 INFO L225 Difference]: With dead ends: 70905 [2025-01-09 10:05:39,432 INFO L226 Difference]: Without dead ends: 35059 [2025-01-09 10:05:39,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:05:39,509 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 373 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:39,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1070 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:05:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35059 states. [2025-01-09 10:05:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35059 to 35049. [2025-01-09 10:05:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35049 states, 28560 states have (on average 1.5992997198879553) internal successors, (45676), 28812 states have internal predecessors, (45676), 6232 states have call successors, (6232), 256 states have call predecessors, (6232), 256 states have return successors, (6232), 5980 states have call predecessors, (6232), 6232 states have call successors, (6232) [2025-01-09 10:05:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35049 states to 35049 states and 58140 transitions. [2025-01-09 10:05:41,965 INFO L78 Accepts]: Start accepts. Automaton has 35049 states and 58140 transitions. Word has length 663 [2025-01-09 10:05:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:41,966 INFO L471 AbstractCegarLoop]: Abstraction has 35049 states and 58140 transitions. [2025-01-09 10:05:41,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 35049 states and 58140 transitions. [2025-01-09 10:05:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:05:41,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:41,995 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:41,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:05:41,995 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:41,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1914750748, now seen corresponding path program 1 times [2025-01-09 10:05:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:41,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053266156] [2025-01-09 10:05:41,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:42,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:05:42,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:05:42,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:42,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053266156] [2025-01-09 10:05:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053266156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:43,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:43,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:05:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681523528] [2025-01-09 10:05:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:43,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:05:43,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:43,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:05:43,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:05:43,917 INFO L87 Difference]: Start difference. First operand 35049 states and 58140 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:50,490 INFO L93 Difference]: Finished difference Result 170893 states and 283200 transitions. [2025-01-09 10:05:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:05:50,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-01-09 10:05:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:50,921 INFO L225 Difference]: With dead ends: 170893 [2025-01-09 10:05:50,921 INFO L226 Difference]: Without dead ends: 135847 [2025-01-09 10:05:51,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:05:51,031 INFO L435 NwaCegarLoop]: 1175 mSDtfsCounter, 1585 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:51,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 2689 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:05:51,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135847 states. [2025-01-09 10:05:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135847 to 104209. [2025-01-09 10:05:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104209 states, 85184 states have (on average 1.5985631104432758) internal successors, (136172), 85944 states have internal predecessors, (136172), 18256 states have call successors, (18256), 768 states have call predecessors, (18256), 768 states have return successors, (18256), 17496 states have call predecessors, (18256), 18256 states have call successors, (18256) [2025-01-09 10:05:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104209 states to 104209 states and 172684 transitions. [2025-01-09 10:05:57,160 INFO L78 Accepts]: Start accepts. Automaton has 104209 states and 172684 transitions. Word has length 663 [2025-01-09 10:05:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:57,161 INFO L471 AbstractCegarLoop]: Abstraction has 104209 states and 172684 transitions. [2025-01-09 10:05:57,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 104209 states and 172684 transitions. [2025-01-09 10:05:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:05:57,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:57,233 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:57,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:05:57,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:57,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash 3708190, now seen corresponding path program 1 times [2025-01-09 10:05:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:57,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788064373] [2025-01-09 10:05:57,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:57,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:05:57,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:05:57,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:57,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788064373] [2025-01-09 10:05:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788064373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:57,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:57,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:57,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594961623] [2025-01-09 10:05:57,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:57,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:57,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:57,455 INFO L87 Difference]: Start difference. First operand 104209 states and 172684 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102)