./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-45.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-250_file-45.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 ad2fb0f87fb0b281072794eb7cd46dfb553a056ca9f2e2f18210a48553fd4c11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:43:13,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:43:13,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:43:13,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:43:13,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:43:13,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:43:13,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:43:13,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:43:13,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:43:13,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:43:13,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:43:13,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:43:13,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:43:13,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:43:13,781 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:43:13,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:43:13,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:43:13,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:43:13,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:43:13,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:43:13,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:43:13,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:43:13,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:43:13,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:43:13,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:43:13,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:43:13,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:43:13,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:43:13,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:43:13,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:43:13,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:43:13,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:43:13,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:43:13,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:43:13,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:43:13,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:43:13,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:43:13,786 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 -> ad2fb0f87fb0b281072794eb7cd46dfb553a056ca9f2e2f18210a48553fd4c11 [2025-01-09 09:43:14,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:43:14,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:43:14,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:43:14,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:43:14,080 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:43:14,081 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-250_file-45.i [2025-01-09 09:43:15,389 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0954d4ebd/cc6e23859c9f4e4eaade01c75b5a9088/FLAGfc58d9047 [2025-01-09 09:43:15,661 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:43:15,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-45.i [2025-01-09 09:43:15,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0954d4ebd/cc6e23859c9f4e4eaade01c75b5a9088/FLAGfc58d9047 [2025-01-09 09:43:15,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0954d4ebd/cc6e23859c9f4e4eaade01c75b5a9088 [2025-01-09 09:43:15,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:43:15,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:43:15,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:43:15,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:43:15,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:43:15,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:15" (1/1) ... [2025-01-09 09:43:15,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112688e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:15, skipping insertion in model container [2025-01-09 09:43:15,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:15" (1/1) ... [2025-01-09 09:43:15,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:43:15,862 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-250_file-45.i[916,929] [2025-01-09 09:43:15,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:43:15,994 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:43:16,001 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-250_file-45.i[916,929] [2025-01-09 09:43:16,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:43:16,075 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:43:16,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16 WrapperNode [2025-01-09 09:43:16,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:43:16,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:43:16,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:43:16,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:43:16,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,138 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2025-01-09 09:43:16,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:43:16,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:43:16,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:43:16,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:43:16,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,184 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 09:43:16,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,201 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:43:16,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:43:16,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:43:16,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:43:16,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (1/1) ... [2025-01-09 09:43:16,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:43:16,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:43:16,264 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 09:43:16,269 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 09:43:16,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:43:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:43:16,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:43:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:43:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:43:16,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:43:16,368 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:43:16,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:43:17,103 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 09:43:17,104 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:43:17,118 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:43:17,118 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:43:17,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:17 BoogieIcfgContainer [2025-01-09 09:43:17,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:43:17,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:43:17,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:43:17,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:43:17,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:43:15" (1/3) ... [2025-01-09 09:43:17,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f89c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:17, skipping insertion in model container [2025-01-09 09:43:17,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:16" (2/3) ... [2025-01-09 09:43:17,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f89c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:17, skipping insertion in model container [2025-01-09 09:43:17,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:17" (3/3) ... [2025-01-09 09:43:17,129 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-45.i [2025-01-09 09:43:17,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:43:17,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-45.i that has 2 procedures, 211 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:43:17,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:43:17,212 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;@2ce10ad2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:43:17,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:43:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 211 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 142 states have internal predecessors, (217), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 09:43:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 09:43:17,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:17,235 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:43:17,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:17,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2026128196, now seen corresponding path program 1 times [2025-01-09 09:43:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:17,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762918193] [2025-01-09 09:43:17,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:17,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 09:43:17,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 09:43:17,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:17,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 09:43:17,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:17,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762918193] [2025-01-09 09:43:17,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762918193] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:43:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179324249] [2025-01-09 09:43:17,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:17,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:43:17,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:43:17,740 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 09:43:17,741 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 09:43:17,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 09:43:18,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 09:43:18,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:18,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:18,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:43:18,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:43:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 09:43:18,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:43:18,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179324249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:18,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:43:18,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:43:18,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543244854] [2025-01-09 09:43:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:18,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:43:18,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:18,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:43:18,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:43:18,130 INFO L87 Difference]: Start difference. First operand has 211 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 142 states have internal predecessors, (217), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 09:43:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:18,179 INFO L93 Difference]: Finished difference Result 416 states and 764 transitions. [2025-01-09 09:43:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:43:18,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 428 [2025-01-09 09:43:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:18,187 INFO L225 Difference]: With dead ends: 416 [2025-01-09 09:43:18,188 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 09:43:18,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 429 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 09:43:18,196 INFO L435 NwaCegarLoop]: 346 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, 346 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 09:43:18,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:43:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 09:43:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-01-09 09:43:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 139 states have (on average 1.525179856115108) internal successors, (212), 139 states have internal predecessors, (212), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 09:43:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 346 transitions. [2025-01-09 09:43:18,259 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 346 transitions. Word has length 428 [2025-01-09 09:43:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:18,259 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 346 transitions. [2025-01-09 09:43:18,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 09:43:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 346 transitions. [2025-01-09 09:43:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 09:43:18,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:18,272 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:43:18,280 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 09:43:18,472 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 09:43:18,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:18,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:18,473 INFO L85 PathProgramCache]: Analyzing trace with hash -911455302, now seen corresponding path program 1 times [2025-01-09 09:43:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:18,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349619758] [2025-01-09 09:43:18,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:18,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:18,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 09:43:18,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 09:43:18,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:18,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 09:43:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349619758] [2025-01-09 09:43:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349619758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:18,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:43:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:43:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050553621] [2025-01-09 09:43:18,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:18,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:43:18,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:18,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:43:18,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:43:18,882 INFO L87 Difference]: Start difference. First operand 208 states and 346 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:18,956 INFO L93 Difference]: Finished difference Result 531 states and 889 transitions. [2025-01-09 09:43:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:43:18,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 428 [2025-01-09 09:43:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:18,963 INFO L225 Difference]: With dead ends: 531 [2025-01-09 09:43:18,965 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 09:43:18,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:43:18,968 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 203 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:18,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 768 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:43:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 09:43:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 323. [2025-01-09 09:43:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 237 states have (on average 1.5822784810126582) internal successors, (375), 238 states have internal predecessors, (375), 83 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 09:43:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 541 transitions. [2025-01-09 09:43:19,018 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 541 transitions. Word has length 428 [2025-01-09 09:43:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:19,020 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 541 transitions. [2025-01-09 09:43:19,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 541 transitions. [2025-01-09 09:43:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 09:43:19,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:19,027 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:43:19,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:43:19,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:19,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash -926974020, now seen corresponding path program 1 times [2025-01-09 09:43:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:19,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870882915] [2025-01-09 09:43:19,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:19,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 09:43:19,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 09:43:19,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:19,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 09:43:19,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:19,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870882915] [2025-01-09 09:43:19,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870882915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:19,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:43:19,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:43:19,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775905605] [2025-01-09 09:43:19,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:19,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:43:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:19,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:43:19,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:43:19,348 INFO L87 Difference]: Start difference. First operand 323 states and 541 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:19,409 INFO L93 Difference]: Finished difference Result 879 states and 1464 transitions. [2025-01-09 09:43:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:43:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 428 [2025-01-09 09:43:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:19,415 INFO L225 Difference]: With dead ends: 879 [2025-01-09 09:43:19,415 INFO L226 Difference]: Without dead ends: 559 [2025-01-09 09:43:19,416 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 09:43:19,418 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 241 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:19,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 677 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:43:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-01-09 09:43:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 556. [2025-01-09 09:43:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 396 states have (on average 1.5454545454545454) internal successors, (612), 399 states have internal predecessors, (612), 155 states have call successors, (155), 4 states have call predecessors, (155), 4 states have return successors, (155), 152 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 09:43:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 922 transitions. [2025-01-09 09:43:19,473 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 922 transitions. Word has length 428 [2025-01-09 09:43:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:19,474 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 922 transitions. [2025-01-09 09:43:19,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 922 transitions. [2025-01-09 09:43:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 09:43:19,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:19,479 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:43:19,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:43:19,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:19,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1562554942, now seen corresponding path program 1 times [2025-01-09 09:43:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788440119] [2025-01-09 09:43:19,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:19,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 09:43:19,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 09:43:19,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:19,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 09:43:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:19,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788440119] [2025-01-09 09:43:19,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788440119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:19,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:43:19,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:43:19,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199586239] [2025-01-09 09:43:19,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:19,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:43:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:19,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:43:19,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:43:19,719 INFO L87 Difference]: Start difference. First operand 556 states and 922 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:19,774 INFO L93 Difference]: Finished difference Result 1121 states and 1850 transitions. [2025-01-09 09:43:19,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:43:19,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 428 [2025-01-09 09:43:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:19,779 INFO L225 Difference]: With dead ends: 1121 [2025-01-09 09:43:19,781 INFO L226 Difference]: Without dead ends: 568 [2025-01-09 09:43:19,782 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 09:43:19,785 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 167 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:19,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 720 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:43:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-09 09:43:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 426. [2025-01-09 09:43:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 298 states have (on average 1.5100671140939597) internal successors, (450), 299 states have internal predecessors, (450), 123 states have call successors, (123), 4 states have call predecessors, (123), 4 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 09:43:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 696 transitions. [2025-01-09 09:43:19,823 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 696 transitions. Word has length 428 [2025-01-09 09:43:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:19,826 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 696 transitions. [2025-01-09 09:43:19,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 696 transitions. [2025-01-09 09:43:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 09:43:19,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:19,832 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:43:19,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:43:19,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:19,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:19,833 INFO L85 PathProgramCache]: Analyzing trace with hash 744906492, now seen corresponding path program 1 times [2025-01-09 09:43:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:19,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969640801] [2025-01-09 09:43:19,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:19,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:19,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 09:43:19,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 09:43:19,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:19,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 09:43:20,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:20,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969640801] [2025-01-09 09:43:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969640801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:20,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:43:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:43:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948174950] [2025-01-09 09:43:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:20,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:43:20,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:20,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:43:20,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:43:20,014 INFO L87 Difference]: Start difference. First operand 426 states and 696 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:20,090 INFO L93 Difference]: Finished difference Result 1266 states and 2070 transitions. [2025-01-09 09:43:20,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:43:20,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 428 [2025-01-09 09:43:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:20,096 INFO L225 Difference]: With dead ends: 1266 [2025-01-09 09:43:20,096 INFO L226 Difference]: Without dead ends: 843 [2025-01-09 09:43:20,098 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 09:43:20,098 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 335 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:20,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 685 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:43:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-01-09 09:43:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 841. [2025-01-09 09:43:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 586 states have (on average 1.4982935153583619) internal successors, (878), 588 states have internal predecessors, (878), 246 states have call successors, (246), 8 states have call predecessors, (246), 8 states have return successors, (246), 244 states have call predecessors, (246), 246 states have call successors, (246) [2025-01-09 09:43:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1370 transitions. [2025-01-09 09:43:20,171 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1370 transitions. Word has length 428 [2025-01-09 09:43:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:20,173 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1370 transitions. [2025-01-09 09:43:20,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1370 transitions. [2025-01-09 09:43:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 09:43:20,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:20,181 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:43:20,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:43:20,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:20,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1335372473, now seen corresponding path program 1 times [2025-01-09 09:43:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:20,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178555813] [2025-01-09 09:43:20,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:20,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 09:43:20,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 09:43:20,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:20,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 09:43:21,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178555813] [2025-01-09 09:43:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178555813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:21,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:43:21,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:43:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227201794] [2025-01-09 09:43:21,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:21,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:43:21,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:21,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:43:21,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:43:21,796 INFO L87 Difference]: Start difference. First operand 841 states and 1370 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:22,594 INFO L93 Difference]: Finished difference Result 2533 states and 4116 transitions. [2025-01-09 09:43:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:43:22,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 429 [2025-01-09 09:43:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:22,606 INFO L225 Difference]: With dead ends: 2533 [2025-01-09 09:43:22,606 INFO L226 Difference]: Without dead ends: 1695 [2025-01-09 09:43:22,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:43:22,611 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 389 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:22,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1171 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:43:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-01-09 09:43:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1625. [2025-01-09 09:43:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1112 states have (on average 1.4712230215827338) internal successors, (1636), 1118 states have internal predecessors, (1636), 492 states have call successors, (492), 20 states have call predecessors, (492), 20 states have return successors, (492), 486 states have call predecessors, (492), 492 states have call successors, (492) [2025-01-09 09:43:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2620 transitions. [2025-01-09 09:43:22,734 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2620 transitions. Word has length 429 [2025-01-09 09:43:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:22,735 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 2620 transitions. [2025-01-09 09:43:22,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2620 transitions. [2025-01-09 09:43:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 09:43:22,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:22,740 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:43:22,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:43:22,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:22,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1844845563, now seen corresponding path program 1 times [2025-01-09 09:43:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:22,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142329302] [2025-01-09 09:43:22,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:22,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:22,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 09:43:22,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 09:43:22,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:22,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat