./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_codestructure_dependencies_file-42.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 a85c63270a82c8ef0a288aa71699029145198375482b0774861abf1408115eb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:20:52,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:20:52,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:20:52,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:20:52,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:20:52,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:20:52,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:20:52,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:20:52,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:20:52,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:20:52,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:20:52,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:20:52,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:20:52,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:20:52,763 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:20:52,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:20:52,764 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:20:52,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:20:52,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:20:52,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:20:52,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:20:52,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:20:52,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:20:52,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:20:52,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:20:52,768 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:20:52,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:20:52,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:20:52,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:20:52,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:20:52,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:20:52,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:20:52,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:20:52,768 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 -> a85c63270a82c8ef0a288aa71699029145198375482b0774861abf1408115eb1 [2025-02-05 20:20:53,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:20:53,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:20:53,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:20:53,071 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:20:53,071 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:20:53,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i [2025-02-05 20:20:54,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/475da98fe/cb948cfbe9f24689b7aa68495b45494d/FLAGe71ea32ad [2025-02-05 20:20:54,741 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:20:54,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i [2025-02-05 20:20:54,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/475da98fe/cb948cfbe9f24689b7aa68495b45494d/FLAGe71ea32ad [2025-02-05 20:20:54,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/475da98fe/cb948cfbe9f24689b7aa68495b45494d [2025-02-05 20:20:54,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:20:54,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:20:54,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:20:54,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:20:54,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:20:54,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:20:54" (1/1) ... [2025-02-05 20:20:54,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:54, skipping insertion in model container [2025-02-05 20:20:54,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:20:54" (1/1) ... [2025-02-05 20:20:54,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:20:54,920 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_codestructure_dependencies_file-42.i[919,932] [2025-02-05 20:20:54,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:20:54,976 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:20:54,985 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_codestructure_dependencies_file-42.i[919,932] [2025-02-05 20:20:55,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:20:55,048 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:20:55,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55 WrapperNode [2025-02-05 20:20:55,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:20:55,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:20:55,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:20:55,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:20:55,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,097 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2025-02-05 20:20:55,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:20:55,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:20:55,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:20:55,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:20:55,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,137 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-02-05 20:20:55,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,143 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:20:55,159 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:20:55,159 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:20:55,159 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:20:55,160 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (1/1) ... [2025-02-05 20:20:55,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:20:55,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:20:55,198 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-02-05 20:20:55,202 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-02-05 20:20:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:20:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:20:55,230 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:20:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:20:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:20:55,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:20:55,287 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:20:55,289 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:20:55,644 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:20:55,647 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:20:55,657 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:20:55,657 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:20:55,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:20:55 BoogieIcfgContainer [2025-02-05 20:20:55,658 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:20:55,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:20:55,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:20:55,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:20:55,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:20:54" (1/3) ... [2025-02-05 20:20:55,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f968adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:20:55, skipping insertion in model container [2025-02-05 20:20:55,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:20:55" (2/3) ... [2025-02-05 20:20:55,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f968adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:20:55, skipping insertion in model container [2025-02-05 20:20:55,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:20:55" (3/3) ... [2025-02-05 20:20:55,666 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-42.i [2025-02-05 20:20:55,681 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:20:55,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-42.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:20:55,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:20:55,756 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;@469c78f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:20:55,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:20:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-05 20:20:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 20:20:55,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:20:55,770 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:20:55,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:20:55,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:20:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1315220903, now seen corresponding path program 1 times [2025-02-05 20:20:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:20:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802239762] [2025-02-05 20:20:55,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:20:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:20:55,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 20:20:55,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 20:20:55,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:20:55,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:20:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-05 20:20:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:20:56,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802239762] [2025-02-05 20:20:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802239762] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:20:56,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934508129] [2025-02-05 20:20:56,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:20:56,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:20:56,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:20:56,056 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-02-05 20:20:56,058 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-02-05 20:20:56,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 20:20:56,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 20:20:56,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:20:56,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:20:56,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:20:56,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:20:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-05 20:20:56,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:20:56,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934508129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:20:56,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:20:56,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:20:56,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847686537] [2025-02-05 20:20:56,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:20:56,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:20:56,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:20:56,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:20:56,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:20:56,266 INFO L87 Difference]: Start difference. First operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 20:20:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:20:56,290 INFO L93 Difference]: Finished difference Result 90 states and 151 transitions. [2025-02-05 20:20:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:20:56,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-02-05 20:20:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:20:56,300 INFO L225 Difference]: With dead ends: 90 [2025-02-05 20:20:56,300 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 20:20:56,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:20:56,308 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:20:56,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:20:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 20:20:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-05 20:20:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-05 20:20:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2025-02-05 20:20:56,339 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 83 [2025-02-05 20:20:56,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:20:56,340 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2025-02-05 20:20:56,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 20:20:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2025-02-05 20:20:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 20:20:56,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:20:56,342 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:20:56,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:20:56,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:20:56,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:20:56,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:20:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1958237896, now seen corresponding path program 1 times [2025-02-05 20:20:56,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:20:56,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350149508] [2025-02-05 20:20:56,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:20:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:20:56,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 20:20:56,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 20:20:56,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:20:56,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:20:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 20:20:57,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:20:57,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350149508] [2025-02-05 20:20:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350149508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:20:57,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:20:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:20:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007607778] [2025-02-05 20:20:57,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:20:57,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:20:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:20:57,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:20:57,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:20:57,032 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 20:20:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:20:57,166 INFO L93 Difference]: Finished difference Result 130 states and 193 transitions. [2025-02-05 20:20:57,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:20:57,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-02-05 20:20:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:20:57,168 INFO L225 Difference]: With dead ends: 130 [2025-02-05 20:20:57,168 INFO L226 Difference]: Without dead ends: 88 [2025-02-05 20:20:57,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:20:57,170 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 60 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:20:57,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 180 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:20:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-05 20:20:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2025-02-05 20:20:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 20:20:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2025-02-05 20:20:57,185 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 83 [2025-02-05 20:20:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:20:57,186 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2025-02-05 20:20:57,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 20:20:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2025-02-05 20:20:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 20:20:57,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:20:57,188 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:20:57,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:20:57,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:20:57,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:20:57,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1677451249, now seen corresponding path program 1 times [2025-02-05 20:20:57,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:20:57,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543640460] [2025-02-05 20:20:57,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:20:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:20:57,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:20:57,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:20:57,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:20:57,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:20:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 20:20:57,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:20:57,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543640460] [2025-02-05 20:20:57,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543640460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:20:57,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:20:57,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:20:57,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008363450] [2025-02-05 20:20:57,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:20:57,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:20:57,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:20:57,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:20:57,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:20:57,491 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 20:20:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:20:57,693 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2025-02-05 20:20:57,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:20:57,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2025-02-05 20:20:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:20:57,696 INFO L225 Difference]: With dead ends: 169 [2025-02-05 20:20:57,696 INFO L226 Difference]: Without dead ends: 127 [2025-02-05 20:20:57,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:20:57,698 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 65 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:20:57,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 183 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:20:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-05 20:20:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2025-02-05 20:20:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:20:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 164 transitions. [2025-02-05 20:20:57,734 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 164 transitions. Word has length 84 [2025-02-05 20:20:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:20:57,735 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 164 transitions. [2025-02-05 20:20:57,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 20:20:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 164 transitions. [2025-02-05 20:20:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 20:20:57,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:20:57,736 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:20:57,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:20:57,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:20:57,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:20:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash -119500110, now seen corresponding path program 1 times [2025-02-05 20:20:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:20:57,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302700960] [2025-02-05 20:20:57,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:20:57,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:20:57,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:20:57,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:20:57,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:20:57,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:20:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-05 20:20:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:20:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302700960] [2025-02-05 20:20:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302700960] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:20:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420090518] [2025-02-05 20:20:58,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:20:58,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:20:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:20:58,345 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-02-05 20:20:58,347 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-02-05 20:20:58,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:20:58,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:20:58,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:20:58,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:20:58,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 20:20:58,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:20:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 20:20:58,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:20:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-02-05 20:20:59,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420090518] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:20:59,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:20:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-02-05 20:20:59,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793391411] [2025-02-05 20:20:59,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:20:59,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 20:20:59,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:20:59,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 20:20:59,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:20:59,045 INFO L87 Difference]: Start difference. First operand 111 states and 164 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 20:20:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:20:59,894 INFO L93 Difference]: Finished difference Result 391 states and 537 transitions. [2025-02-05 20:20:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-05 20:20:59,895 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 84 [2025-02-05 20:20:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:20:59,898 INFO L225 Difference]: With dead ends: 391 [2025-02-05 20:20:59,898 INFO L226 Difference]: Without dead ends: 309 [2025-02-05 20:20:59,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=482, Invalid=1410, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 20:20:59,902 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 237 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:20:59,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 355 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:20:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-05 20:20:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 187. [2025-02-05 20:20:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 126 states have internal predecessors, (156), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 20:20:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 252 transitions. [2025-02-05 20:20:59,946 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 252 transitions. Word has length 84 [2025-02-05 20:20:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:20:59,948 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 252 transitions. [2025-02-05 20:20:59,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 20:20:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 252 transitions. [2025-02-05 20:20:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 20:20:59,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:20:59,949 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:20:59,958 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-02-05 20:21:00,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:21:00,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:21:00,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:21:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash -316013615, now seen corresponding path program 1 times [2025-02-05 20:21:00,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:21:00,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748025113] [2025-02-05 20:21:00,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:21:00,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:21:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:21:00,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:21:00,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:00,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:21:00,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125598353] [2025-02-05 20:21:00,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:21:00,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:21:00,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:21:00,217 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-02-05 20:21:00,219 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-02-05 20:21:00,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:21:00,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:21:00,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:00,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:21:00,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 20:21:00,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:21:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-05 20:21:00,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:21:01,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:21:01,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748025113] [2025-02-05 20:21:01,185 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 20:21:01,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125598353] [2025-02-05 20:21:01,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125598353] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:21:01,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:21:01,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-02-05 20:21:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16500939] [2025-02-05 20:21:01,188 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 20:21:01,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:21:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:21:01,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:21:01,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:21:01,189 INFO L87 Difference]: Start difference. First operand 187 states and 252 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 20:21:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:21:01,515 INFO L93 Difference]: Finished difference Result 562 states and 743 transitions. [2025-02-05 20:21:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:21:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 84 [2025-02-05 20:21:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:21:01,519 INFO L225 Difference]: With dead ends: 562 [2025-02-05 20:21:01,519 INFO L226 Difference]: Without dead ends: 417 [2025-02-05 20:21:01,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:21:01,521 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 124 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:21:01,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 279 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:21:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-02-05 20:21:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 350. [2025-02-05 20:21:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 240 states have (on average 1.2166666666666666) internal successors, (292), 240 states have internal predecessors, (292), 84 states have call successors, (84), 25 states have call predecessors, (84), 25 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 20:21:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 460 transitions. [2025-02-05 20:21:01,575 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 460 transitions. Word has length 84 [2025-02-05 20:21:01,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:21:01,576 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 460 transitions. [2025-02-05 20:21:01,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 20:21:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 460 transitions. [2025-02-05 20:21:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 20:21:01,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:21:01,580 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:21:01,588 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-02-05 20:21:01,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:21:01,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:21:01,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:21:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1068490086, now seen corresponding path program 1 times [2025-02-05 20:21:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:21:01,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625363655] [2025-02-05 20:21:01,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:21:01,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:21:01,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 20:21:01,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 20:21:01,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:01,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:21:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [804768640] [2025-02-05 20:21:01,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:21:01,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:21:01,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:21:01,833 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-02-05 20:21:01,835 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-02-05 20:21:01,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 20:21:01,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 20:21:01,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:01,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:21:01,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:21:01,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 20:21:01,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 20:21:01,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:01,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:21:01,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:21:01,999 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:21:02,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:21:02,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 20:21:02,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 20:21:02,205 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-05 20:21:02,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:21:02,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:21:02 BoogieIcfgContainer [2025-02-05 20:21:02,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:21:02,289 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:21:02,289 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:21:02,289 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:21:02,290 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:20:55" (3/4) ... [2025-02-05 20:21:02,292 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:21:02,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:21:02,293 INFO L158 Benchmark]: Toolchain (without parser) took 7516.06ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 113.5MB in the end (delta: 19.7MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2025-02-05 20:21:02,294 INFO L158 Benchmark]: CDTParser took 1.35ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:21:02,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.47ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 119.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:21:02,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.34ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 116.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:21:02,295 INFO L158 Benchmark]: Boogie Preprocessor took 60.38ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 111.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:21:02,295 INFO L158 Benchmark]: IcfgBuilder took 499.25ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 92.1MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:21:02,296 INFO L158 Benchmark]: TraceAbstraction took 6628.09ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 113.6MB in the end (delta: -21.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:21:02,296 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 113.5MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:21:02,297 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.47ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 119.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.34ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 116.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.38ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 111.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 499.25ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 92.1MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6628.09ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 113.6MB in the end (delta: -21.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 113.5MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] signed short int last_1_var_1_1 = 16; [L37] unsigned char last_1_var_1_6 = 10; [L38] unsigned char last_1_var_1_8 = 1; [L39] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L109] last_1_var_1_1 = var_1_1 [L110] last_1_var_1_6 = var_1_6 [L111] last_1_var_1_8 = var_1_8 [L112] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L122] RET updateLastVariables() [L123] CALL updateVariables() [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=128, var_1_8=1] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=128, var_1_8=1] [L90] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=128, var_1_8=1] [L90] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=128, var_1_8=1] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L92] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L93] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L93] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L94] var_1_11 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L95] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L96] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L96] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L97] var_1_12 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L98] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L99] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L99] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L100] var_1_15 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L101] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L102] var_1_16 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L103] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L104] var_1_20 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L105] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L106] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L106] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L123] RET updateVariables() [L124] CALL step() [L43] COND TRUE (((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L44] COND FALSE !(last_1_var_1_1 <= last_1_var_1_6) [L47] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L52] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=10, var_1_7=-258, var_1_8=1] [L55] COND TRUE var_1_5 >= -2 [L56] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=154, var_1_7=-258, var_1_8=1] [L58] COND TRUE last_1_var_1_13 >= (var_1_6 / var_1_7) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=154, var_1_7=-258, var_1_8=1] [L59] COND TRUE var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L60] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=154, var_1_7=-258, var_1_8=1] [L67] COND FALSE !(var_1_6 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=82, var_1_6=154, var_1_7=-258, var_1_8=1] [L70] COND TRUE \read(var_1_19) [L71] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=82, var_1_6=154, var_1_7=-258, var_1_8=1] [L77] COND FALSE !((49.5f <= var_1_14) && (var_1_19 && var_1_19)) [L84] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=82, var_1_6=154, var_1_7=-258, var_1_8=0] [L124] RET step() [L125] CALL, EXPR property() [L115-L116] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=82, var_1_6=154, var_1_7=-258, var_1_8=0] [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=82, var_1_6=154, var_1_7=-258, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=82, var_1_6=154, var_1_7=-258, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 1063 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 725 mSDsCounter, 204 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 544 IncrementalHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 204 mSolverCounterUnsat, 338 mSDtfsCounter, 544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 222 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 839 NumberOfCodeBlocks, 839 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 661 ConstructedInterpolants, 0 QuantifiedInterpolants, 1922 SizeOfPredicates, 8 NumberOfNonLiveVariables, 653 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 2033/2112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 20:21:02,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_codestructure_dependencies_file-42.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 a85c63270a82c8ef0a288aa71699029145198375482b0774861abf1408115eb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:21:04,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:21:04,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:21:04,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:21:04,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:21:04,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:21:04,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:21:04,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:21:04,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:21:04,719 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:21:04,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:21:04,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:21:04,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:21:04,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:21:04,720 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:21:04,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:21:04,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:21:04,720 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:21:04,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:21:04,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:21:04,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:21:04,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:21:04,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:21:04,723 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:21:04,723 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:21:04,724 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:21:04,724 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:21:04,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:21:04,724 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:21:04,724 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:21:04,724 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:21:04,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:21:04,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:21:04,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:21:04,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:21:04,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:21:04,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:21:04,725 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:21:04,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:21:04,726 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:21:04,726 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:21:04,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:21:04,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:21:04,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:21:04,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:21:04,727 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 -> a85c63270a82c8ef0a288aa71699029145198375482b0774861abf1408115eb1 [2025-02-05 20:21:05,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:21:05,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:21:05,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:21:05,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:21:05,044 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:21:05,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i [2025-02-05 20:21:06,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c73d8d3d/825e83555cd14f079d3a175e8ebe0ab5/FLAG24b7d58ca [2025-02-05 20:21:06,552 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:21:06,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i [2025-02-05 20:21:06,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c73d8d3d/825e83555cd14f079d3a175e8ebe0ab5/FLAG24b7d58ca [2025-02-05 20:21:06,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c73d8d3d/825e83555cd14f079d3a175e8ebe0ab5 [2025-02-05 20:21:06,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:21:06,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:21:06,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:21:06,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:21:06,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:21:06,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677bbde1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06, skipping insertion in model container [2025-02-05 20:21:06,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:21:06,732 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_codestructure_dependencies_file-42.i[919,932] [2025-02-05 20:21:06,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:21:06,820 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:21:06,832 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_codestructure_dependencies_file-42.i[919,932] [2025-02-05 20:21:06,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:21:06,889 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:21:06,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06 WrapperNode [2025-02-05 20:21:06,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:21:06,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:21:06,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:21:06,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:21:06,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,939 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-02-05 20:21:06,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:21:06,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:21:06,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:21:06,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:21:06,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,971 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-02-05 20:21:06,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,984 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:06,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:21:07,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:21:07,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:21:07,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:21:07,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (1/1) ... [2025-02-05 20:21:07,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:21:07,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:21:07,035 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-02-05 20:21:07,043 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-02-05 20:21:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:21:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:21:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:21:07,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:21:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:21:07,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:21:07,126 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:21:07,127 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:21:07,576 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:21:07,577 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:21:07,585 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:21:07,586 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:21:07,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:21:07 BoogieIcfgContainer [2025-02-05 20:21:07,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:21:07,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:21:07,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:21:07,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:21:07,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:21:06" (1/3) ... [2025-02-05 20:21:07,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161127cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:21:07, skipping insertion in model container [2025-02-05 20:21:07,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:21:06" (2/3) ... [2025-02-05 20:21:07,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161127cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:21:07, skipping insertion in model container [2025-02-05 20:21:07,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:21:07" (3/3) ... [2025-02-05 20:21:07,596 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-42.i [2025-02-05 20:21:07,607 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:21:07,609 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-42.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:21:07,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:21:07,659 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;@1fc05e25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:21:07,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:21:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-05 20:21:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 20:21:07,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:21:07,673 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:21:07,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:21:07,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:21:07,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1315220903, now seen corresponding path program 1 times [2025-02-05 20:21:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:21:07,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793612117] [2025-02-05 20:21:07,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:21:07,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:21:07,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:21:07,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:21:07,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 20:21:07,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 20:21:07,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 20:21:07,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:07,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:21:07,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:21:07,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:21:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-05 20:21:07,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:21:07,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:21:07,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793612117] [2025-02-05 20:21:07,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793612117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:21:07,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:21:07,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:21:07,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733027567] [2025-02-05 20:21:07,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:21:07,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:21:07,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:21:07,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:21:07,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:21:07,989 INFO L87 Difference]: Start difference. First operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 20:21:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:21:08,008 INFO L93 Difference]: Finished difference Result 90 states and 151 transitions. [2025-02-05 20:21:08,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:21:08,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-02-05 20:21:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:21:08,013 INFO L225 Difference]: With dead ends: 90 [2025-02-05 20:21:08,014 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 20:21:08,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:21:08,019 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:21:08,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:21:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 20:21:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-05 20:21:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-05 20:21:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2025-02-05 20:21:08,057 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 83 [2025-02-05 20:21:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:21:08,057 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2025-02-05 20:21:08,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 20:21:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2025-02-05 20:21:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 20:21:08,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:21:08,062 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:21:08,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 20:21:08,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:21:08,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:21:08,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:21:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1958237896, now seen corresponding path program 1 times [2025-02-05 20:21:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:21:08,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589406220] [2025-02-05 20:21:08,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:21:08,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:21:08,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:21:08,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:21:08,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 20:21:08,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 20:21:08,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 20:21:08,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:08,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:21:08,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 20:21:08,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:21:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 20:21:08,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:21:08,685 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:21:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589406220] [2025-02-05 20:21:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589406220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:21:08,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:21:08,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:21:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474677484] [2025-02-05 20:21:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:21:08,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:21:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:21:08,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:21:08,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:21:08,690 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 20:21:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:21:08,941 INFO L93 Difference]: Finished difference Result 130 states and 193 transitions. [2025-02-05 20:21:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:21:08,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-02-05 20:21:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:21:08,948 INFO L225 Difference]: With dead ends: 130 [2025-02-05 20:21:08,948 INFO L226 Difference]: Without dead ends: 88 [2025-02-05 20:21:08,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-02-05 20:21:08,949 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:21:08,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:21:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-05 20:21:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2025-02-05 20:21:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 20:21:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2025-02-05 20:21:08,963 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 83 [2025-02-05 20:21:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:21:08,963 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2025-02-05 20:21:08,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 20:21:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2025-02-05 20:21:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 20:21:08,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:21:08,965 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:21:08,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 20:21:09,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:21:09,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:21:09,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:21:09,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1677451249, now seen corresponding path program 1 times [2025-02-05 20:21:09,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:21:09,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097149831] [2025-02-05 20:21:09,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:21:09,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:21:09,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:21:09,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:21:09,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 20:21:09,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:21:09,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:21:09,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:09,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:21:09,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 20:21:09,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:21:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 20:21:09,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:21:09,841 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:21:09,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097149831] [2025-02-05 20:21:09,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097149831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:21:09,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:21:09,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:21:09,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544546230] [2025-02-05 20:21:09,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:21:09,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:21:09,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:21:09,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:21:09,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:21:09,842 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 20:21:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:21:10,435 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2025-02-05 20:21:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:21:10,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2025-02-05 20:21:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:21:10,438 INFO L225 Difference]: With dead ends: 169 [2025-02-05 20:21:10,438 INFO L226 Difference]: Without dead ends: 127 [2025-02-05 20:21:10,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 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-02-05 20:21:10,440 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 62 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:21:10,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 181 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:21:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-05 20:21:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2025-02-05 20:21:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:21:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 164 transitions. [2025-02-05 20:21:10,464 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 164 transitions. Word has length 84 [2025-02-05 20:21:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:21:10,465 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 164 transitions. [2025-02-05 20:21:10,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 20:21:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 164 transitions. [2025-02-05 20:21:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 20:21:10,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:21:10,468 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:21:10,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 20:21:10,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:21:10,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:21:10,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:21:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash -119500110, now seen corresponding path program 1 times [2025-02-05 20:21:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:21:10,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453536044] [2025-02-05 20:21:10,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:21:10,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:21:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:21:10,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:21:10,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 20:21:10,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:21:10,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:21:10,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:10,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:21:10,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 20:21:10,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:21:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 20:21:11,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:21:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-02-05 20:21:11,308 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:21:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453536044] [2025-02-05 20:21:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453536044] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:21:11,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:21:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-02-05 20:21:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391630632] [2025-02-05 20:21:11,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:21:11,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 20:21:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:21:11,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 20:21:11,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:21:11,310 INFO L87 Difference]: Start difference. First operand 111 states and 164 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 20:21:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:21:12,204 INFO L93 Difference]: Finished difference Result 295 states and 405 transitions. [2025-02-05 20:21:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 20:21:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 84 [2025-02-05 20:21:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:21:12,207 INFO L225 Difference]: With dead ends: 295 [2025-02-05 20:21:12,207 INFO L226 Difference]: Without dead ends: 213 [2025-02-05 20:21:12,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 20:21:12,208 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 173 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:21:12,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 288 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:21:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-05 20:21:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 187. [2025-02-05 20:21:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 126 states have internal predecessors, (156), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 20:21:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 252 transitions. [2025-02-05 20:21:12,251 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 252 transitions. Word has length 84 [2025-02-05 20:21:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:21:12,251 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 252 transitions. [2025-02-05 20:21:12,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 20:21:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 252 transitions. [2025-02-05 20:21:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 20:21:12,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:21:12,254 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:21:12,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-05 20:21:12,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:21:12,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:21:12,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:21:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash -316013615, now seen corresponding path program 1 times [2025-02-05 20:21:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:21:12,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524965338] [2025-02-05 20:21:12,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:21:12,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:21:12,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:21:12,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:21:12,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-05 20:21:12,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:21:12,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:21:12,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:12,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:21:12,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 20:21:12,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:21:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-05 20:21:12,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:21:13,224 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:21:13,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524965338] [2025-02-05 20:21:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524965338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:21:13,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1812226703] [2025-02-05 20:21:13,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:21:13,224 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 20:21:13,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 20:21:13,230 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 20:21:13,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-02-05 20:21:13,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:21:13,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:21:13,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:21:13,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:21:13,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 20:21:13,605 INFO L279 TraceCheckSpWp]: Computing forward predicates...