./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.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 e812dc698b4655d38d198bd0d019421c12f3fcceff72c56e7a8be5775cf6eb49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:47:58,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:47:58,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:47:58,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:47:58,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:47:58,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:47:58,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:47:58,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:47:58,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:47:58,594 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:47:58,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:47:58,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:47:58,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:47:58,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:47:58,595 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:47:58,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:47:58,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:47:58,596 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:47:58,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:47:58,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:47:58,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:47:58,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:47:58,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:47:58,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:47:58,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:47:58,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:47:58,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:47:58,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:47:58,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:47:58,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:47:58,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:47:58,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:47:58,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:47:58,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:47:58,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:47:58,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:47:58,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:47:58,599 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 -> e812dc698b4655d38d198bd0d019421c12f3fcceff72c56e7a8be5775cf6eb49 [2025-01-09 08:47:58,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:47:58,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:47:58,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:47:58,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:47:58,907 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:47:58,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.i [2025-01-09 08:48:00,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eecab0198/56253b18b5b94f60934da4d98499e2fc/FLAG5234f61a5 [2025-01-09 08:48:00,554 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:48:00,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.i [2025-01-09 08:48:00,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eecab0198/56253b18b5b94f60934da4d98499e2fc/FLAG5234f61a5 [2025-01-09 08:48:00,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eecab0198/56253b18b5b94f60934da4d98499e2fc [2025-01-09 08:48:00,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:48:00,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:48:00,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:48:00,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:48:00,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:48:00,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:00,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ab6914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00, skipping insertion in model container [2025-01-09 08:48:00,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:00,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:48:00,758 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_normal_file-9.i[912,925] [2025-01-09 08:48:00,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:48:00,836 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:48:00,852 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_normal_file-9.i[912,925] [2025-01-09 08:48:00,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:48:00,899 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:48:00,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00 WrapperNode [2025-01-09 08:48:00,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:48:00,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:48:00,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:48:00,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:48:00,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:00,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:00,958 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-01-09 08:48:00,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:48:00,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:48:00,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:48:00,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:48:00,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:00,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:00,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:00,996 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:48:01,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:01,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:01,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:01,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:01,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:01,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:01,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:01,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:48:01,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:48:01,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:48:01,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:48:01,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (1/1) ... [2025-01-09 08:48:01,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:48:01,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:48:01,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:48:01,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:48:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:48:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:48:01,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:48:01,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:48:01,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:48:01,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:48:01,155 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:48:01,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:48:01,522 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 08:48:01,522 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:48:01,530 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:48:01,532 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:48:01,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:48:01 BoogieIcfgContainer [2025-01-09 08:48:01,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:48:01,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:48:01,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:48:01,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:48:01,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:48:00" (1/3) ... [2025-01-09 08:48:01,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1779ece4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:48:01, skipping insertion in model container [2025-01-09 08:48:01,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:00" (2/3) ... [2025-01-09 08:48:01,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1779ece4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:48:01, skipping insertion in model container [2025-01-09 08:48:01,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:48:01" (3/3) ... [2025-01-09 08:48:01,541 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-9.i [2025-01-09 08:48:01,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:48:01,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-9.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:48:01,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:48:01,610 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;@57d9f7cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:48:01,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:48:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 08:48:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 08:48:01,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:01,624 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:48:01,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:01,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:01,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2040680227, now seen corresponding path program 1 times [2025-01-09 08:48:01,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:48:01,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098064486] [2025-01-09 08:48:01,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:01,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:48:01,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 08:48:01,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 08:48:01,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:01,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 08:48:01,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:48:01,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098064486] [2025-01-09 08:48:01,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098064486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:48:01,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357443276] [2025-01-09 08:48:01,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:01,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:48:01,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:48:01,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:48:01,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:48:01,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 08:48:02,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 08:48:02,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:02,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:02,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:48:02,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:48:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 08:48:02,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:48:02,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357443276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:48:02,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:48:02,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:48:02,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707409608] [2025-01-09 08:48:02,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:48:02,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:48:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:48:02,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:48:02,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:48:02,115 INFO L87 Difference]: Start difference. First operand has 79 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 08:48:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:48:02,144 INFO L93 Difference]: Finished difference Result 152 states and 254 transitions. [2025-01-09 08:48:02,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:48:02,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2025-01-09 08:48:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:48:02,153 INFO L225 Difference]: With dead ends: 152 [2025-01-09 08:48:02,153 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 08:48:02,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:48:02,160 INFO L435 NwaCegarLoop]: 114 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, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:48:02,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:48:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 08:48:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-09 08:48:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 08:48:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2025-01-09 08:48:02,205 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 138 [2025-01-09 08:48:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:48:02,206 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2025-01-09 08:48:02,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 08:48:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2025-01-09 08:48:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 08:48:02,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:02,213 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:48:02,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 08:48:02,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 08:48:02,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:02,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:02,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2115306455, now seen corresponding path program 1 times [2025-01-09 08:48:02,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:48:02,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594346687] [2025-01-09 08:48:02,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:48:02,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 08:48:02,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 08:48:02,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:02,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 08:48:02,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:48:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594346687] [2025-01-09 08:48:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594346687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:48:02,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:48:02,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:48:02,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146078403] [2025-01-09 08:48:02,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:48:02,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:48:02,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:48:02,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:48:02,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:48:02,710 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:48:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:48:02,733 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2025-01-09 08:48:02,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:48:02,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 138 [2025-01-09 08:48:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:48:02,735 INFO L225 Difference]: With dead ends: 150 [2025-01-09 08:48:02,735 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 08:48:02,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:48:02,736 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:48:02,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:48:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 08:48:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 08:48:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 08:48:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2025-01-09 08:48:02,756 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 138 [2025-01-09 08:48:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:48:02,757 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2025-01-09 08:48:02,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:48:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2025-01-09 08:48:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 08:48:02,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:02,762 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:48:02,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:48:02,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:02,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash -880760513, now seen corresponding path program 1 times [2025-01-09 08:48:02,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:48:02,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733238192] [2025-01-09 08:48:02,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:02,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:48:02,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 08:48:02,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 08:48:02,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:02,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 08:48:03,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:48:03,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733238192] [2025-01-09 08:48:03,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733238192] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:48:03,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877470486] [2025-01-09 08:48:03,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:03,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:48:03,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:48:03,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:48:03,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:48:03,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 08:48:04,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 08:48:04,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:04,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:04,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 08:48:04,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:48:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 08:48:04,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:48:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877470486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:48:04,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:48:04,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-01-09 08:48:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080269186] [2025-01-09 08:48:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:48:04,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:48:04,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:48:04,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:48:04,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:48:04,252 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:48:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:48:04,511 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2025-01-09 08:48:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:48:04,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-01-09 08:48:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:48:04,514 INFO L225 Difference]: With dead ends: 234 [2025-01-09 08:48:04,515 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 08:48:04,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:48:04,518 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 101 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:48:04,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 449 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:48:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 08:48:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 131. [2025-01-09 08:48:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 104 states have internal predecessors, (145), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 08:48:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 195 transitions. [2025-01-09 08:48:04,535 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 195 transitions. Word has length 139 [2025-01-09 08:48:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:48:04,535 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 195 transitions. [2025-01-09 08:48:04,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:48:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 195 transitions. [2025-01-09 08:48:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 08:48:04,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:04,538 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:48:04,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 08:48:04,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:48:04,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:04,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash 399103165, now seen corresponding path program 1 times [2025-01-09 08:48:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:48:04,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496804480] [2025-01-09 08:48:04,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:48:04,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 08:48:04,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 08:48:04,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:04,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 08:48:06,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:48:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496804480] [2025-01-09 08:48:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496804480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:48:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045614097] [2025-01-09 08:48:06,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:06,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:48:06,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:48:06,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:48:06,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:48:06,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 08:48:06,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 08:48:06,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:06,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:06,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 08:48:06,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:48:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 08:48:06,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:48:06,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045614097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:48:06,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:48:06,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2025-01-09 08:48:06,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622890067] [2025-01-09 08:48:06,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:48:06,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:48:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:48:06,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:48:06,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:48:06,722 INFO L87 Difference]: Start difference. First operand 131 states and 195 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:48:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:48:06,984 INFO L93 Difference]: Finished difference Result 290 states and 424 transitions. [2025-01-09 08:48:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:48:06,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-01-09 08:48:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:48:06,988 INFO L225 Difference]: With dead ends: 290 [2025-01-09 08:48:06,988 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 08:48:06,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:48:06,993 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 101 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:48:06,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 439 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:48:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 08:48:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 117. [2025-01-09 08:48:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 90 states have internal predecessors, (122), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 08:48:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2025-01-09 08:48:07,019 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 139 [2025-01-09 08:48:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:48:07,020 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2025-01-09 08:48:07,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:48:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2025-01-09 08:48:07,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 08:48:07,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:07,026 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:48:07,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 08:48:07,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:48:07,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:07,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:07,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1901828867, now seen corresponding path program 1 times [2025-01-09 08:48:07,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:48:07,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92538226] [2025-01-09 08:48:07,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:07,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:48:07,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 08:48:07,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 08:48:07,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:07,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 08:48:08,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:48:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92538226] [2025-01-09 08:48:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92538226] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:48:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832860163] [2025-01-09 08:48:08,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:08,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:48:08,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:48:08,170 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:48:08,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 08:48:08,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 08:48:08,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 08:48:08,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:08,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:08,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 08:48:08,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:48:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 493 proven. 138 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 08:48:09,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:48:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 08:48:10,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832860163] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 08:48:10,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:48:10,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 19] total 25 [2025-01-09 08:48:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438767825] [2025-01-09 08:48:10,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:48:10,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:48:10,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:48:10,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:48:10,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2025-01-09 08:48:10,237 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:48:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:48:10,672 INFO L93 Difference]: Finished difference Result 313 states and 449 transitions. [2025-01-09 08:48:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:48:10,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-01-09 08:48:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:48:10,677 INFO L225 Difference]: With dead ends: 313 [2025-01-09 08:48:10,678 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 08:48:10,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-01-09 08:48:10,680 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 92 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:48:10,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 503 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:48:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 08:48:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 173. [2025-01-09 08:48:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 141 states have (on average 1.3900709219858156) internal successors, (196), 143 states have internal predecessors, (196), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 08:48:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2025-01-09 08:48:10,713 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 139 [2025-01-09 08:48:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:48:10,713 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2025-01-09 08:48:10,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:48:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2025-01-09 08:48:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 08:48:10,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:10,718 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:48:10,727 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-01-09 08:48:10,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:48:10,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:10,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash -621965189, now seen corresponding path program 1 times [2025-01-09 08:48:10,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:48:10,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724072299] [2025-01-09 08:48:10,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:48:10,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 08:48:10,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 08:48:10,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:10,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 08:48:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:48:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724072299] [2025-01-09 08:48:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724072299] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:48:12,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427439201] [2025-01-09 08:48:12,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:12,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:48:12,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:48:12,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:48:12,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 08:48:12,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 08:48:12,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 08:48:12,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:12,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:12,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 08:48:12,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:48:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 493 proven. 138 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 08:48:13,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:48:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 08:48:14,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427439201] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 08:48:14,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:48:14,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 18] total 26 [2025-01-09 08:48:14,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869710652] [2025-01-09 08:48:14,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:48:14,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:48:14,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:48:14,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:48:14,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2025-01-09 08:48:14,112 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:48:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:48:14,381 INFO L93 Difference]: Finished difference Result 356 states and 511 transitions. [2025-01-09 08:48:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:48:14,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-01-09 08:48:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:48:14,384 INFO L225 Difference]: With dead ends: 356 [2025-01-09 08:48:14,384 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 08:48:14,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-01-09 08:48:14,387 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 81 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:48:14,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 366 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:48:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 08:48:14,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 159. [2025-01-09 08:48:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 127 states have (on average 1.3622047244094488) internal successors, (173), 129 states have internal predecessors, (173), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 08:48:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 227 transitions. [2025-01-09 08:48:14,405 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 227 transitions. Word has length 139 [2025-01-09 08:48:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:48:14,406 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 227 transitions. [2025-01-09 08:48:14,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:48:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 227 transitions. [2025-01-09 08:48:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 08:48:14,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:14,408 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:48:14,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 08:48:14,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:48:14,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:14,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:14,609 INFO L85 PathProgramCache]: Analyzing trace with hash -850749734, now seen corresponding path program 1 times [2025-01-09 08:48:14,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:48:14,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212547726] [2025-01-09 08:48:14,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:14,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:48:14,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 08:48:14,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 08:48:14,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:14,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:48:14,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845625879] [2025-01-09 08:48:14,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:14,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:48:14,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:48:14,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:48:14,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 08:48:14,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 08:48:14,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 08:48:14,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:14,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:48:14,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:48:14,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 08:48:14,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 08:48:14,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:14,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:48:15,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:48:15,042 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:48:15,043 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:48:15,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 08:48:15,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 08:48:15,247 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:48:15,330 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:48:15,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:48:15 BoogieIcfgContainer [2025-01-09 08:48:15,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:48:15,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:48:15,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:48:15,337 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:48:15,339 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:48:01" (3/4) ... [2025-01-09 08:48:15,340 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:48:15,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:48:15,343 INFO L158 Benchmark]: Toolchain (without parser) took 14751.68ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 112.3MB in the beginning and 138.1MB in the end (delta: -25.8MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. [2025-01-09 08:48:15,343 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:48:15,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.41ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 98.4MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:48:15,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.46ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:48:15,344 INFO L158 Benchmark]: Boogie Preprocessor took 61.96ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:48:15,344 INFO L158 Benchmark]: RCFGBuilder took 506.70ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 73.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:48:15,345 INFO L158 Benchmark]: TraceAbstraction took 13801.51ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 72.9MB in the beginning and 138.1MB in the end (delta: -65.3MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2025-01-09 08:48:15,345 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 302.0MB. Free memory was 138.1MB in the beginning and 138.1MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:48:15,347 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.41ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 98.4MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.46ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.96ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 506.70ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 73.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13801.51ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 72.9MB in the beginning and 138.1MB in the end (delta: -65.3MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 302.0MB. Free memory was 138.1MB in the beginning and 138.1MB in the end (delta: 60.1kB). 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 someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed char var_1_2 = 100; [L24] signed short int var_1_3 = 1; [L25] signed long int var_1_4 = -16; [L26] signed long int var_1_5 = -64; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 5; [L29] double var_1_8 = 16.25; [L30] double var_1_9 = 1.8; [L31] unsigned char var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] unsigned short int var_1_12 = 16; [L34] unsigned long int var_1_13 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned short int var_1_16 = 256; [L37] unsigned short int var_1_17 = 8; [L38] signed char var_1_18 = -2; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=100, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L124] isInitial = 1 [L125] FCALL initially() [L127] FCALL updateLastVariables() [L128] CALL updateVariables() [L84] var_1_2 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L85] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L87] var_1_3 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L88] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] var_1_4 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] var_1_5 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] var_1_6 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L100] var_1_7 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L103] var_1_8 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0, var_1_9=9/5] [L104] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0, var_1_9=9/5] [L105] var_1_9 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L106] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L107] var_1_11 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L109] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L109] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L110] var_1_15 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L112] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L112] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L113] var_1_17 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L114] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L115] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L115] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L128] RET updateVariables() [L129] CALL step() [L42] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L42] COND FALSE !((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) [L49] COND TRUE var_1_6 <= (var_1_4 + var_1_7) [L50] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L54] COND FALSE !(((var_1_6 >> 2) * var_1_10) > var_1_4) VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L57] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L57] COND TRUE (1 << var_1_2) != (-500 / -100) [L58] COND FALSE !((var_1_6 - var_1_3) >= (var_1_10 + 256)) [L61] var_1_13 = var_1_12 VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=16, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L66] COND FALSE !((- var_1_9) <= var_1_8) [L79] var_1_16 = var_1_10 VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=16, var_1_15=0, var_1_16=253, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L81] var_1_18 = var_1_3 VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=16, var_1_15=0, var_1_16=253, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=16, var_1_15=0, var_1_16=253, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L120] EXPR ((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=16, var_1_15=0, var_1_16=253, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L120] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=16, var_1_15=0, var_1_16=253, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L120] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=16, var_1_15=0, var_1_16=253, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L120] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=16, var_1_15=0, var_1_16=253, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L120-L121] return (((((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_2) ? ((var_1_17 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=16, var_1_15=0, var_1_16=253, var_1_17=0, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] [L19] reach_error() VAL [isInitial=1, var_1_10=253, var_1_11=253, var_1_12=16, var_1_13=16, var_1_15=0, var_1_16=253, var_1_17=0, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=507, var_1_5=254, var_1_6=8, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 375 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 2092 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1276 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 702 IncrementalHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 816 mSDtfsCounter, 702 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1021 GetRequests, 947 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=5, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 127 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1808 NumberOfCodeBlocks, 1808 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1791 ConstructedInterpolants, 0 QuantifiedInterpolants, 7558 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1559 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 10544/10920 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-01-09 08:48:15,376 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_normal_file-9.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 e812dc698b4655d38d198bd0d019421c12f3fcceff72c56e7a8be5775cf6eb49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:48:17,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:48:17,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 08:48:17,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:48:17,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:48:17,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:48:17,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:48:17,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:48:17,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:48:17,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:48:17,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:48:17,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:48:17,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:48:17,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:48:17,655 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:48:17,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:48:17,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:48:17,656 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:48:17,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:48:17,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:48:17,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:48:17,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:48:17,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:48:17,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:48:17,658 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:48:17,658 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:48:17,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:48:17,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:48:17,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:48:17,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:48:17,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:48:17,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:48:17,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:48:17,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:48:17,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:48:17,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:48:17,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:48:17,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:48:17,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:48:17,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:48:17,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:48:17,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:48:17,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:48:17,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:48:17,661 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:48:17,661 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:48:17,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:48:17,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:48:17,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:48:17,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:48:17,662 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 -> e812dc698b4655d38d198bd0d019421c12f3fcceff72c56e7a8be5775cf6eb49 [2025-01-09 08:48:17,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:48:17,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:48:17,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:48:17,963 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:48:17,964 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:48:17,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.i [2025-01-09 08:48:19,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7acc52ef/56282d1bae7a4d309fca9efbe54569f6/FLAGddabc1360 [2025-01-09 08:48:19,513 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:48:19,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-9.i [2025-01-09 08:48:19,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7acc52ef/56282d1bae7a4d309fca9efbe54569f6/FLAGddabc1360 [2025-01-09 08:48:19,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7acc52ef/56282d1bae7a4d309fca9efbe54569f6 [2025-01-09 08:48:19,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:48:19,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:48:19,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:48:19,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:48:19,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:48:19,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ee1ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19, skipping insertion in model container [2025-01-09 08:48:19,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:48:19,695 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_normal_file-9.i[912,925] [2025-01-09 08:48:19,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:48:19,779 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:48:19,791 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_normal_file-9.i[912,925] [2025-01-09 08:48:19,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:48:19,838 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:48:19,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19 WrapperNode [2025-01-09 08:48:19,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:48:19,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:48:19,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:48:19,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:48:19,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,881 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2025-01-09 08:48:19,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:48:19,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:48:19,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:48:19,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:48:19,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,904 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:48:19,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:48:19,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:48:19,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:48:19,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:48:19,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (1/1) ... [2025-01-09 08:48:19,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:48:19,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:48:19,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:48:19,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:48:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:48:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:48:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:48:19,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:48:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:48:19,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:48:20,041 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:48:20,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:48:20,390 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:48:20,391 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:48:20,398 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:48:20,398 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:48:20,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:48:20 BoogieIcfgContainer [2025-01-09 08:48:20,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:48:20,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:48:20,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:48:20,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:48:20,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:48:19" (1/3) ... [2025-01-09 08:48:20,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cd83af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:48:20, skipping insertion in model container [2025-01-09 08:48:20,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:19" (2/3) ... [2025-01-09 08:48:20,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cd83af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:48:20, skipping insertion in model container [2025-01-09 08:48:20,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:48:20" (3/3) ... [2025-01-09 08:48:20,407 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-9.i [2025-01-09 08:48:20,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:48:20,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-9.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:48:20,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:48:20,484 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;@7a64aabe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:48:20,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:48:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 08:48:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 08:48:20,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:20,501 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:48:20,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:20,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:20,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1963620097, now seen corresponding path program 1 times [2025-01-09 08:48:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:48:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232052078] [2025-01-09 08:48:20,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:20,514 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-01-09 08:48:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:48:20,516 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-01-09 08:48:20,518 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-01-09 08:48:20,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 08:48:20,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 08:48:20,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:20,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:20,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:48:20,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:48:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-01-09 08:48:20,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:48:20,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:48:20,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232052078] [2025-01-09 08:48:20,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232052078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:48:20,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:48:20,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:48:20,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851671419] [2025-01-09 08:48:20,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:48:20,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:48:20,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:48:20,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:48:20,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:48:20,815 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 08:48:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:48:20,842 INFO L93 Difference]: Finished difference Result 116 states and 202 transitions. [2025-01-09 08:48:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:48:20,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-01-09 08:48:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:48:20,853 INFO L225 Difference]: With dead ends: 116 [2025-01-09 08:48:20,854 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 08:48:20,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:48:20,860 INFO L435 NwaCegarLoop]: 87 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, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:48:20,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:48:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 08:48:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-09 08:48:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 08:48:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2025-01-09 08:48:20,904 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 131 [2025-01-09 08:48:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:48:20,904 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2025-01-09 08:48:20,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 08:48:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2025-01-09 08:48:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 08:48:20,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:20,909 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:48:20,919 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 08:48:21,109 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-01-09 08:48:21,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:21,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash 798899192, now seen corresponding path program 1 times [2025-01-09 08:48:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:48:21,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316615341] [2025-01-09 08:48:21,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:21,112 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-01-09 08:48:21,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:48:21,114 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-01-09 08:48:21,116 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-01-09 08:48:21,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 08:48:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 08:48:21,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:21,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:21,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 08:48:21,335 INFO L279 TraceCheckSpWp]: Computing forward predicates...