./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-95.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-95.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 e3471f06dc12ad44598fd2961f3d0cb274ed30b5886ce0a764ca9d78e786b896 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:49:16,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:49:16,711 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:49:16,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:49:16,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:49:16,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:49:16,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:49:16,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:49:16,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:49:16,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:49:16,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:49:16,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:49:16,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:49:16,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:49:16,739 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:49:16,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:49:16,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:49:16,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:49:16,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:49:16,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:49:16,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:49:16,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:49:16,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:49:16,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:49:16,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:49:16,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:49:16,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:49:16,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:49:16,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:49:16,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:49:16,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:49:16,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:49:16,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:49:16,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:49:16,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:49:16,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:49:16,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:49:16,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:49:16,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:49:16,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:49:16,742 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:49:16,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:49:16,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:49:16,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:49:16,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:49:16,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:49:16,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:49:16,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:49:16,743 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 -> e3471f06dc12ad44598fd2961f3d0cb274ed30b5886ce0a764ca9d78e786b896 [2025-01-09 09:49:16,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:49:16,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:49:16,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:49:16,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:49:16,989 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:49:16,990 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-95.i [2025-01-09 09:49:18,187 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c45a12a5d/df3c1b1c85d541aa8d1606aaba4c13dc/FLAG06a7945f2 [2025-01-09 09:49:18,468 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:49:18,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-95.i [2025-01-09 09:49:18,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c45a12a5d/df3c1b1c85d541aa8d1606aaba4c13dc/FLAG06a7945f2 [2025-01-09 09:49:18,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c45a12a5d/df3c1b1c85d541aa8d1606aaba4c13dc [2025-01-09 09:49:18,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:49:18,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:49:18,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:49:18,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:49:18,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:49:18,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18, skipping insertion in model container [2025-01-09 09:49:18,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:49:18,652 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-95.i[916,929] [2025-01-09 09:49:18,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:49:18,761 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:49:18,769 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-95.i[916,929] [2025-01-09 09:49:18,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:49:18,823 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:49:18,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18 WrapperNode [2025-01-09 09:49:18,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:49:18,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:49:18,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:49:18,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:49:18,829 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:49:18" (1/1) ... [2025-01-09 09:49:18,849 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:49:18" (1/1) ... [2025-01-09 09:49:18,887 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2025-01-09 09:49:18,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:49:18,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:49:18,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:49:18,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:49:18,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,912 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:49:18,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:49:18,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:49:18,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:49:18,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:49:18,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (1/1) ... [2025-01-09 09:49:18,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:49:18,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:18,971 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:49:18,973 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:49:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:49:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:49:18,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:49:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:49:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:49:18,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:49:19,066 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:49:19,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:49:19,668 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 09:49:19,669 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:49:19,677 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:49:19,677 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:49:19,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:49:19 BoogieIcfgContainer [2025-01-09 09:49:19,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:49:19,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:49:19,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:49:19,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:49:19,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:49:18" (1/3) ... [2025-01-09 09:49:19,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4f80ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:49:19, skipping insertion in model container [2025-01-09 09:49:19,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:18" (2/3) ... [2025-01-09 09:49:19,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4f80ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:49:19, skipping insertion in model container [2025-01-09 09:49:19,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:49:19" (3/3) ... [2025-01-09 09:49:19,684 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-95.i [2025-01-09 09:49:19,693 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:49:19,694 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-95.i that has 2 procedures, 217 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:49:19,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:49:19,737 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;@2dc28f77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:49:19,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:49:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 151 states have (on average 1.5496688741721854) internal successors, (234), 152 states have internal predecessors, (234), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 09:49:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-01-09 09:49:19,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:19,753 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:19,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:19,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash 262225932, now seen corresponding path program 1 times [2025-01-09 09:49:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854310361] [2025-01-09 09:49:19,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:19,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:19,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-09 09:49:19,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-09 09:49:19,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:19,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-01-09 09:49:20,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854310361] [2025-01-09 09:49:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854310361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:20,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:20,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:49:20,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688913892] [2025-01-09 09:49:20,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:20,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:49:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:20,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:49:20,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:49:20,407 INFO L87 Difference]: Start difference. First operand has 217 states, 151 states have (on average 1.5496688741721854) internal successors, (234), 152 states have internal predecessors, (234), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-01-09 09:49:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:20,644 INFO L93 Difference]: Finished difference Result 779 states and 1432 transitions. [2025-01-09 09:49:20,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:49:20,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 408 [2025-01-09 09:49:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:20,655 INFO L225 Difference]: With dead ends: 779 [2025-01-09 09:49:20,655 INFO L226 Difference]: Without dead ends: 565 [2025-01-09 09:49:20,658 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 09:49:20,660 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 577 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:20,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1361 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:49:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-01-09 09:49:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 556. [2025-01-09 09:49:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 429 states have (on average 1.5827505827505828) internal successors, (679), 432 states have internal predecessors, (679), 122 states have call successors, (122), 4 states have call predecessors, (122), 4 states have return successors, (122), 119 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 09:49:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 923 transitions. [2025-01-09 09:49:20,729 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 923 transitions. Word has length 408 [2025-01-09 09:49:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:20,730 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 923 transitions. [2025-01-09 09:49:20,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-01-09 09:49:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 923 transitions. [2025-01-09 09:49:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 09:49:20,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:20,736 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:20,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 09:49:20,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:20,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:20,737 INFO L85 PathProgramCache]: Analyzing trace with hash 693509887, now seen corresponding path program 1 times [2025-01-09 09:49:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:20,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125827297] [2025-01-09 09:49:20,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:20,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:20,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 09:49:20,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 09:49:20,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:20,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-01-09 09:49:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125827297] [2025-01-09 09:49:21,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125827297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:21,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:21,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:49:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382913241] [2025-01-09 09:49:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:21,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:49:21,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:21,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:49:21,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:49:21,053 INFO L87 Difference]: Start difference. First operand 556 states and 923 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-01-09 09:49:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:21,123 INFO L93 Difference]: Finished difference Result 1121 states and 1852 transitions. [2025-01-09 09:49:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:49:21,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 409 [2025-01-09 09:49:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:21,133 INFO L225 Difference]: With dead ends: 1121 [2025-01-09 09:49:21,133 INFO L226 Difference]: Without dead ends: 568 [2025-01-09 09:49:21,136 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:49:21,137 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 201 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:21,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 798 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:49:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-09 09:49:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 395. [2025-01-09 09:49:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 298 states have (on average 1.5604026845637584) internal successors, (465), 299 states have internal predecessors, (465), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 09:49:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 649 transitions. [2025-01-09 09:49:21,194 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 649 transitions. Word has length 409 [2025-01-09 09:49:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:21,194 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 649 transitions. [2025-01-09 09:49:21,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-01-09 09:49:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 649 transitions. [2025-01-09 09:49:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 09:49:21,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:21,203 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:21,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:49:21,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:21,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1012662977, now seen corresponding path program 1 times [2025-01-09 09:49:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294652214] [2025-01-09 09:49:21,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:21,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 09:49:21,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 09:49:21,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:21,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-01-09 09:49:21,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:21,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294652214] [2025-01-09 09:49:21,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294652214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:21,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:21,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:49:21,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926548830] [2025-01-09 09:49:21,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:21,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:49:21,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:21,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:49:21,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:49:21,434 INFO L87 Difference]: Start difference. First operand 395 states and 649 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-01-09 09:49:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:21,491 INFO L93 Difference]: Finished difference Result 996 states and 1621 transitions. [2025-01-09 09:49:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:49:21,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 409 [2025-01-09 09:49:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:21,499 INFO L225 Difference]: With dead ends: 996 [2025-01-09 09:49:21,500 INFO L226 Difference]: Without dead ends: 604 [2025-01-09 09:49:21,502 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:49:21,502 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 177 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:21,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 810 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:49:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-01-09 09:49:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 601. [2025-01-09 09:49:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 428 states have (on average 1.5023364485981308) internal successors, (643), 431 states have internal predecessors, (643), 164 states have call successors, (164), 8 states have call predecessors, (164), 8 states have return successors, (164), 161 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 09:49:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 971 transitions. [2025-01-09 09:49:21,554 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 971 transitions. Word has length 409 [2025-01-09 09:49:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:21,555 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 971 transitions. [2025-01-09 09:49:21,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-01-09 09:49:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 971 transitions. [2025-01-09 09:49:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 09:49:21,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:21,561 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:21,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:49:21,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:21,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash 792775357, now seen corresponding path program 1 times [2025-01-09 09:49:21,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:21,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34711797] [2025-01-09 09:49:21,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:21,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 09:49:21,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 09:49:21,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:21,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-01-09 09:49:22,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:22,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34711797] [2025-01-09 09:49:22,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34711797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:22,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:22,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:49:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597081892] [2025-01-09 09:49:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:22,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:49:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:22,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:49:22,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:49:22,187 INFO L87 Difference]: Start difference. First operand 601 states and 971 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-01-09 09:49:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:22,278 INFO L93 Difference]: Finished difference Result 1263 states and 2025 transitions. [2025-01-09 09:49:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:49:22,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 409 [2025-01-09 09:49:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:22,284 INFO L225 Difference]: With dead ends: 1263 [2025-01-09 09:49:22,284 INFO L226 Difference]: Without dead ends: 665 [2025-01-09 09:49:22,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:49:22,287 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 214 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:22,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 610 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:49:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-01-09 09:49:22,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 664. [2025-01-09 09:49:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 459 states have (on average 1.4618736383442266) internal successors, (671), 463 states have internal predecessors, (671), 191 states have call successors, (191), 13 states have call predecessors, (191), 13 states have return successors, (191), 187 states have call predecessors, (191), 191 states have call successors, (191) [2025-01-09 09:49:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1053 transitions. [2025-01-09 09:49:22,350 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1053 transitions. Word has length 409 [2025-01-09 09:49:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:22,351 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 1053 transitions. [2025-01-09 09:49:22,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-01-09 09:49:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1053 transitions. [2025-01-09 09:49:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-01-09 09:49:22,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:22,359 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:22,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:49:22,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:22,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:22,360 INFO L85 PathProgramCache]: Analyzing trace with hash 72228558, now seen corresponding path program 1 times [2025-01-09 09:49:22,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:22,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239494130] [2025-01-09 09:49:22,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:22,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:22,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-01-09 09:49:22,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-01-09 09:49:22,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:22,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 63 proven. 123 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-01-09 09:49:23,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:23,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239494130] [2025-01-09 09:49:23,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239494130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:49:23,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543609773] [2025-01-09 09:49:23,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:23,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:23,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:23,469 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:49:23,471 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:49:23,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-01-09 09:49:23,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-01-09 09:49:23,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:23,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:23,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 09:49:23,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:49:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 4517 proven. 228 refuted. 0 times theorem prover too weak. 3067 trivial. 0 not checked. [2025-01-09 09:49:25,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:49:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-01-09 09:49:26,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543609773] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:49:26,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:49:26,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 24 [2025-01-09 09:49:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23116590] [2025-01-09 09:49:26,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:49:26,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 09:49:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:26,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 09:49:26,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-01-09 09:49:26,064 INFO L87 Difference]: Start difference. First operand 664 states and 1053 transitions. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 5 states have call successors, (147), 3 states have call predecessors, (147), 6 states have return successors, (149), 5 states have call predecessors, (149), 5 states have call successors, (149) [2025-01-09 09:49:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:40,239 INFO L93 Difference]: Finished difference Result 6737 states and 10157 transitions. [2025-01-09 09:49:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2025-01-09 09:49:40,241 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 5 states have call successors, (147), 3 states have call predecessors, (147), 6 states have return successors, (149), 5 states have call predecessors, (149), 5 states have call successors, (149) Word has length 411 [2025-01-09 09:49:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:40,268 INFO L225 Difference]: With dead ends: 6737 [2025-01-09 09:49:40,269 INFO L226 Difference]: Without dead ends: 6123 [2025-01-09 09:49:40,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 827 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18239 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7485, Invalid=35157, Unknown=0, NotChecked=0, Total=42642 [2025-01-09 09:49:40,281 INFO L435 NwaCegarLoop]: 1023 mSDtfsCounter, 2557 mSDsluCounter, 8018 mSDsCounter, 0 mSdLazyCounter, 7325 mSolverCounterSat, 960 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2558 SdHoareTripleChecker+Valid, 9041 SdHoareTripleChecker+Invalid, 8285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 960 IncrementalHoareTripleChecker+Valid, 7325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:40,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2558 Valid, 9041 Invalid, 8285 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [960 Valid, 7325 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2025-01-09 09:49:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2025-01-09 09:49:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 4476. [2025-01-09 09:49:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4476 states, 3369 states have (on average 1.4594835262689225) internal successors, (4917), 3413 states have internal predecessors, (4917), 967 states have call successors, (967), 139 states have call predecessors, (967), 139 states have return successors, (967), 923 states have call predecessors, (967), 967 states have call successors, (967) [2025-01-09 09:49:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 6851 transitions. [2025-01-09 09:49:40,723 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 6851 transitions. Word has length 411 [2025-01-09 09:49:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:40,725 INFO L471 AbstractCegarLoop]: Abstraction has 4476 states and 6851 transitions. [2025-01-09 09:49:40,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 5 states have call successors, (147), 3 states have call predecessors, (147), 6 states have return successors, (149), 5 states have call predecessors, (149), 5 states have call successors, (149) [2025-01-09 09:49:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 6851 transitions. [2025-01-09 09:49:40,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-09 09:49:40,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:40,737 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:40,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:49:40,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:40,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:40,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1774065494, now seen corresponding path program 1 times [2025-01-09 09:49:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:40,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391860782] [2025-01-09 09:49:40,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:40,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 09:49:41,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 09:49:41,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:41,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 63 proven. 123 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-01-09 09:49:41,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391860782] [2025-01-09 09:49:41,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391860782] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:49:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908525027] [2025-01-09 09:49:41,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:41,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:41,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:41,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:49:41,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:49:41,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 09:49:41,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 09:49:41,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:41,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:41,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 09:49:41,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:49:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 5455 proven. 330 refuted. 0 times theorem prover too weak. 2027 trivial. 0 not checked. [2025-01-09 09:49:43,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:49:45,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908525027] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:49:45,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:49:45,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18] total 20 [2025-01-09 09:49:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682458694] [2025-01-09 09:49:45,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:49:45,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 09:49:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:45,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 09:49:45,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2025-01-09 09:49:45,957 INFO L87 Difference]: Start difference. First operand 4476 states and 6851 transitions. Second operand has 20 states, 20 states have (on average 7.9) internal successors, (158), 19 states have internal predecessors, (158), 7 states have call successors, (106), 6 states have call predecessors, (106), 10 states have return successors, (107), 7 states have call predecessors, (107), 7 states have call successors, (107) [2025-01-09 09:49:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:47,634 INFO L93 Difference]: Finished difference Result 11306 states and 17019 transitions. [2025-01-09 09:49:47,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 09:49:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.9) internal successors, (158), 19 states have internal predecessors, (158), 7 states have call successors, (106), 6 states have call predecessors, (106), 10 states have return successors, (107), 7 states have call predecessors, (107), 7 states have call successors, (107) Word has length 412 [2025-01-09 09:49:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:47,661 INFO L225 Difference]: With dead ends: 11306 [2025-01-09 09:49:47,661 INFO L226 Difference]: Without dead ends: 6876 [2025-01-09 09:49:47,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=389, Invalid=1417, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 09:49:47,671 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 945 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:47,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 1443 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:49:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6876 states. [2025-01-09 09:49:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6876 to 2191. [2025-01-09 09:49:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2191 states, 1659 states have (on average 1.4394213381555154) internal successors, (2388), 1677 states have internal predecessors, (2388), 453 states have call successors, (453), 78 states have call predecessors, (453), 78 states have return successors, (453), 435 states have call predecessors, (453), 453 states have call successors, (453) [2025-01-09 09:49:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 3294 transitions. [2025-01-09 09:49:47,969 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 3294 transitions. Word has length 412 [2025-01-09 09:49:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:47,969 INFO L471 AbstractCegarLoop]: Abstraction has 2191 states and 3294 transitions. [2025-01-09 09:49:47,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.9) internal successors, (158), 19 states have internal predecessors, (158), 7 states have call successors, (106), 6 states have call predecessors, (106), 10 states have return successors, (107), 7 states have call predecessors, (107), 7 states have call successors, (107) [2025-01-09 09:49:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 3294 transitions. [2025-01-09 09:49:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-09 09:49:47,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:47,975 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:47,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 09:49:48,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:48,180 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:48,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1893714405, now seen corresponding path program 1 times [2025-01-09 09:49:48,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:48,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052728015] [2025-01-09 09:49:48,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:48,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:48,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 09:49:48,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 09:49:48,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:48,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-01-09 09:49:48,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:48,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052728015] [2025-01-09 09:49:48,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052728015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:48,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:48,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:49:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329109415] [2025-01-09 09:49:48,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:48,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:49:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:48,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:49:48,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:49:48,412 INFO L87 Difference]: Start difference. First operand 2191 states and 3294 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-01-09 09:49:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:48,701 INFO L93 Difference]: Finished difference Result 5222 states and 7833 transitions. [2025-01-09 09:49:48,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:49:48,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 412 [2025-01-09 09:49:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:48,715 INFO L225 Difference]: With dead ends: 5222 [2025-01-09 09:49:48,715 INFO L226 Difference]: Without dead ends: 3077 [2025-01-09 09:49:48,720 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 09:49:48,721 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 230 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:48,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 746 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:49:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2025-01-09 09:49:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 3074. [2025-01-09 09:49:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 2297 states have (on average 1.4270787984327384) internal successors, (3278), 2320 states have internal predecessors, (3278), 659 states have call successors, (659), 117 states have call predecessors, (659), 117 states have return successors, (659), 636 states have call predecessors, (659), 659 states have call successors, (659) [2025-01-09 09:49:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 4596 transitions. [2025-01-09 09:49:48,991 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 4596 transitions. Word has length 412 [2025-01-09 09:49:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:48,991 INFO L471 AbstractCegarLoop]: Abstraction has 3074 states and 4596 transitions. [2025-01-09 09:49:48,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-01-09 09:49:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4596 transitions. [2025-01-09 09:49:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 09:49:48,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:48,994 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:48,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:49:48,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:48,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash -838955973, now seen corresponding path program 1 times [2025-01-09 09:49:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:48,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968724121] [2025-01-09 09:49:48,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:48,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:49,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 09:49:49,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 09:49:49,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:49,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 414 proven. 126 refuted. 0 times theorem prover too weak. 7272 trivial. 0 not checked. [2025-01-09 09:49:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968724121] [2025-01-09 09:49:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968724121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:49:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435860063] [2025-01-09 09:49:52,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:52,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:52,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:52,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:49:52,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:49:52,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 09:49:52,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 09:49:52,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:52,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:52,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 09:49:52,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:49:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 5768 proven. 414 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2025-01-09 09:49:55,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:50:06,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435860063] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:50:06,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:50:06,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 31] total 44 [2025-01-09 09:50:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81635046] [2025-01-09 09:50:06,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:50:06,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 09:50:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:50:06,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 09:50:06,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=3746, Unknown=0, NotChecked=0, Total=4422 [2025-01-09 09:50:06,028 INFO L87 Difference]: Start difference. First operand 3074 states and 4596 transitions. Second operand has 44 states, 44 states have (on average 4.431818181818182) internal successors, (195), 43 states have internal predecessors, (195), 11 states have call successors, (105), 7 states have call predecessors, (105), 11 states have return successors, (106), 11 states have call predecessors, (106), 11 states have call successors, (106) [2025-01-09 09:50:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:50:27,180 INFO L93 Difference]: Finished difference Result 8117 states and 11949 transitions. [2025-01-09 09:50:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-01-09 09:50:27,181 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.431818181818182) internal successors, (195), 43 states have internal predecessors, (195), 11 states have call successors, (105), 7 states have call predecessors, (105), 11 states have return successors, (106), 11 states have call predecessors, (106), 11 states have call successors, (106) Word has length 414 [2025-01-09 09:50:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:50:27,212 INFO L225 Difference]: With dead ends: 8117 [2025-01-09 09:50:27,212 INFO L226 Difference]: Without dead ends: 5972 [2025-01-09 09:50:27,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5012 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=4109, Invalid=15631, Unknown=0, NotChecked=0, Total=19740 [2025-01-09 09:50:27,226 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 4924 mSDsluCounter, 6005 mSDsCounter, 0 mSdLazyCounter, 9998 mSolverCounterSat, 1404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4928 SdHoareTripleChecker+Valid, 6431 SdHoareTripleChecker+Invalid, 11402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1404 IncrementalHoareTripleChecker+Valid, 9998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:50:27,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4928 Valid, 6431 Invalid, 11402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1404 Valid, 9998 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2025-01-09 09:50:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2025-01-09 09:50:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3069. [2025-01-09 09:50:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 2286 states have (on average 1.4094488188976377) internal successors, (3222), 2305 states have internal predecessors, (3222), 647 states have call successors, (647), 135 states have call predecessors, (647), 135 states have return successors, (647), 628 states have call predecessors, (647), 647 states have call successors, (647) [2025-01-09 09:50:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 4516 transitions. [2025-01-09 09:50:27,786 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 4516 transitions. Word has length 414 [2025-01-09 09:50:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:50:27,788 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 4516 transitions. [2025-01-09 09:50:27,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.431818181818182) internal successors, (195), 43 states have internal predecessors, (195), 11 states have call successors, (105), 7 states have call predecessors, (105), 11 states have return successors, (106), 11 states have call predecessors, (106), 11 states have call successors, (106) [2025-01-09 09:50:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4516 transitions. [2025-01-09 09:50:27,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 09:50:27,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:50:27,800 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:27,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 09:50:28,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:50:28,001 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:50:28,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:50:28,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1232710831, now seen corresponding path program 1 times [2025-01-09 09:50:28,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:50:28,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537304638] [2025-01-09 09:50:28,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:28,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:50:28,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 09:50:28,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 09:50:28,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:28,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 537 proven. 333 refuted. 0 times theorem prover too weak. 6942 trivial. 0 not checked. [2025-01-09 09:50:30,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:50:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537304638] [2025-01-09 09:50:30,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537304638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:50:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923600214] [2025-01-09 09:50:30,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:50:30,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:50:30,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:50:30,171 INFO L229 MonitoredProcess]: Starting monitored process 5 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:50:30,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 09:50:30,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 09:50:30,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 09:50:30,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:50:30,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:50:30,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 09:50:30,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:50:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 4761 proven. 549 refuted. 0 times theorem prover too weak. 2502 trivial. 0 not checked. [2025-01-09 09:50:35,094 INFO L312 TraceCheckSpWp]: Computing backward predicates...