./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.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 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:23:15,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:23:15,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:23:15,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:23:15,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:23:15,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:23:15,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:23:15,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:23:15,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:23:15,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:23:15,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:23:15,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:23:15,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:23:15,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:23:15,775 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:23:15,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:23:15,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:23:15,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:23:15,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:23:15,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:23:15,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:23:15,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:23:15,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:23:15,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:23:15,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:23:15,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:23:15,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:23:15,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:23:15,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:23:15,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:23:15,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:23:15,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:23:15,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:23:15,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:23:15,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:23:15,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:23:15,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:23:15,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:23:15,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:23:15,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:23:15,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:23:15,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:23:15,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:23:15,778 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 -> 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 [2025-02-05 20:23:15,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:23:15,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:23:16,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:23:16,001 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:23:16,001 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:23:16,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2025-02-05 20:23:17,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/019ed3147/d43eacdbdd8949899a84e2fc42f61ab4/FLAG0d801c4e1 [2025-02-05 20:23:17,370 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:23:17,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2025-02-05 20:23:17,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/019ed3147/d43eacdbdd8949899a84e2fc42f61ab4/FLAG0d801c4e1 [2025-02-05 20:23:17,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/019ed3147/d43eacdbdd8949899a84e2fc42f61ab4 [2025-02-05 20:23:17,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:23:17,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:23:17,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:23:17,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:23:17,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:23:17,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c22a3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17, skipping insertion in model container [2025-02-05 20:23:17,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:23:17,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2025-02-05 20:23:17,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:23:17,540 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:23:17,549 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2025-02-05 20:23:17,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:23:17,579 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:23:17,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17 WrapperNode [2025-02-05 20:23:17,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:23:17,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:23:17,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:23:17,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:23:17,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,626 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-02-05 20:23:17,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:23:17,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:23:17,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:23:17,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:23:17,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,658 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:23:17,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:23:17,677 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:23:17,677 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:23:17,677 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:23:17,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (1/1) ... [2025-02-05 20:23:17,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:23:17,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:23:17,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:23:17,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:23:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:23:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:23:17,727 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:23:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:23:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:23:17,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:23:17,782 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:23:17,784 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:23:18,090 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:23:18,091 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:23:18,102 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:23:18,102 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:23:18,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:23:18 BoogieIcfgContainer [2025-02-05 20:23:18,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:23:18,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:23:18,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:23:18,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:23:18,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:23:17" (1/3) ... [2025-02-05 20:23:18,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c13650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:23:18, skipping insertion in model container [2025-02-05 20:23:18,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:23:17" (2/3) ... [2025-02-05 20:23:18,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c13650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:23:18, skipping insertion in model container [2025-02-05 20:23:18,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:23:18" (3/3) ... [2025-02-05 20:23:18,109 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-59.i [2025-02-05 20:23:18,121 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:23:18,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-59.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:23:18,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:23:18,173 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;@dc9402b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:23:18,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:23:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 20:23:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 20:23:18,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:23:18,182 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:23:18,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:23:18,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:23:18,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1203039355, now seen corresponding path program 1 times [2025-02-05 20:23:18,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:23:18,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632123288] [2025-02-05 20:23:18,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:23:18,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:23:18,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 20:23:18,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 20:23:18,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:23:18,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:23:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-05 20:23:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:23:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632123288] [2025-02-05 20:23:18,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632123288] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:23:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049595468] [2025-02-05 20:23:18,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:23:18,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:23:18,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:23:18,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:23:18,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:23:18,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 20:23:18,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 20:23:18,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:23:18,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:23:18,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:23:18,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:23:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-05 20:23:18,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:23:18,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049595468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:23:18,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:23:18,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:23:18,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926833641] [2025-02-05 20:23:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:23:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:23:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:23:18,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:23:18,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:23:18,512 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 20:23:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:23:18,526 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2025-02-05 20:23:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:23:18,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2025-02-05 20:23:18,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:23:18,532 INFO L225 Difference]: With dead ends: 96 [2025-02-05 20:23:18,532 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 20:23:18,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:23:18,537 INFO L435 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:23:18,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:23:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 20:23:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-05 20:23:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 20:23:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-02-05 20:23:18,559 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 93 [2025-02-05 20:23:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:23:18,559 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-02-05 20:23:18,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 20:23:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-02-05 20:23:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 20:23:18,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:23:18,565 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:23:18,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:23:18,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:23:18,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:23:18,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:23:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1144901407, now seen corresponding path program 1 times [2025-02-05 20:23:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:23:18,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539918065] [2025-02-05 20:23:18,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:23:18,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:23:18,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 20:23:18,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 20:23:18,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:23:18,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:23:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 20:23:19,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:23:19,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539918065] [2025-02-05 20:23:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539918065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:23:19,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:23:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:23:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488461542] [2025-02-05 20:23:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:23:19,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:23:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:23:19,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:23:19,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:23:19,101 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 20:23:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:23:19,199 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2025-02-05 20:23:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:23:19,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-02-05 20:23:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:23:19,202 INFO L225 Difference]: With dead ends: 139 [2025-02-05 20:23:19,203 INFO L226 Difference]: Without dead ends: 94 [2025-02-05 20:23:19,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:23:19,204 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 49 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:23:19,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:23:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-05 20:23:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2025-02-05 20:23:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 20:23:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2025-02-05 20:23:19,226 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 93 [2025-02-05 20:23:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:23:19,227 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2025-02-05 20:23:19,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 20:23:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2025-02-05 20:23:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 20:23:19,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:23:19,228 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:23:19,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:23:19,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:23:19,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:23:19,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1221135147, now seen corresponding path program 1 times [2025-02-05 20:23:19,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:23:19,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513360358] [2025-02-05 20:23:19,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:23:19,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:23:19,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 20:23:19,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 20:23:19,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:23:19,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:23:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 20:23:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:23:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513360358] [2025-02-05 20:23:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513360358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:23:19,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:23:19,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:23:19,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949323105] [2025-02-05 20:23:19,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:23:19,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:23:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:23:19,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:23:19,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:23:19,555 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 20:23:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:23:19,682 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2025-02-05 20:23:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:23:19,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-02-05 20:23:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:23:19,685 INFO L225 Difference]: With dead ends: 176 [2025-02-05 20:23:19,686 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 20:23:19,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:23:19,687 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 64 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:23:19,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 253 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:23:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 20:23:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2025-02-05 20:23:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 20:23:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2025-02-05 20:23:19,702 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 94 [2025-02-05 20:23:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:23:19,703 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2025-02-05 20:23:19,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 20:23:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2025-02-05 20:23:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 20:23:19,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:23:19,704 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:23:19,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:23:19,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:23:19,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:23:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1951714493, now seen corresponding path program 1 times [2025-02-05 20:23:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:23:19,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561400030] [2025-02-05 20:23:19,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:23:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:23:19,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 20:23:19,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 20:23:19,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:23:19,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:23:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471428123] [2025-02-05 20:23:19,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:23:19,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:23:19,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:23:19,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:23:19,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:23:19,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 20:23:20,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 20:23:20,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:23:20,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:23:20,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 20:23:20,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:23:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-05 20:23:21,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:23:47,135 WARN L286 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 20:23:53,700 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 20:24:04,672 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod c_~var_1_17~0 65536)) (.cse3 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (forall ((v_z_5 Int)) (or (< v_z_5 .cse3) (not (= v_z_5 (mod (* v_z_5 .cse2) 4294967296))) (< .cse4 v_z_5) (< v_z_5 .cse1))) (or (not (= .cse5 .cse0)) (< .cse6 .cse0)) (or (< .cse4 .cse5) (< .cse5 .cse3) (< .cse6 .cse5)))))) is different from false [2025-02-05 20:24:35,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:24:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561400030] [2025-02-05 20:24:35,471 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 20:24:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471428123] [2025-02-05 20:24:35,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471428123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:24:35,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:24:35,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-02-05 20:24:35,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978949143] [2025-02-05 20:24:35,472 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 20:24:35,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:24:35,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:24:35,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:24:35,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=507, Unknown=2, NotChecked=50, Total=756 [2025-02-05 20:24:35,473 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 20:24:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:24:40,770 INFO L93 Difference]: Finished difference Result 299 states and 391 transitions. [2025-02-05 20:24:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 20:24:40,771 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 95 [2025-02-05 20:24:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:24:40,773 INFO L225 Difference]: With dead ends: 299 [2025-02-05 20:24:40,773 INFO L226 Difference]: Without dead ends: 211 [2025-02-05 20:24:40,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=313, Invalid=811, Unknown=2, NotChecked=64, Total=1190 [2025-02-05 20:24:40,774 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 111 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:24:40,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 293 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 20:24:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-05 20:24:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2025-02-05 20:24:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.134453781512605) internal successors, (135), 119 states have internal predecessors, (135), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 20:24:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 219 transitions. [2025-02-05 20:24:40,799 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 219 transitions. Word has length 95 [2025-02-05 20:24:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:24:40,799 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 219 transitions. [2025-02-05 20:24:40,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 20:24:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 219 transitions. [2025-02-05 20:24:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 20:24:40,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:24:40,801 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:24:40,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:24:41,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:24:41,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:24:41,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:24:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 403221352, now seen corresponding path program 1 times [2025-02-05 20:24:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:24:41,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884221211] [2025-02-05 20:24:41,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:24:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:24:41,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 20:24:41,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 20:24:41,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:24:41,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:24:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472627285] [2025-02-05 20:24:41,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:24:41,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:24:41,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:24:41,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:24:41,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:24:41,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 20:24:41,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 20:24:41,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:24:41,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:24:41,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:24:41,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 20:24:41,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 20:24:41,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:24:41,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:24:41,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:24:41,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:24:41,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:24:41,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 20:24:41,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:24:41,741 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-05 20:24:41,793 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:24:41,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:24:41 BoogieIcfgContainer [2025-02-05 20:24:41,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:24:41,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:24:41,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:24:41,796 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:24:41,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:23:18" (3/4) ... [2025-02-05 20:24:41,798 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:24:41,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:24:41,799 INFO L158 Benchmark]: Toolchain (without parser) took 84404.98ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 48.8MB in the end (delta: 80.8MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2025-02-05 20:24:41,799 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:24:41,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.00ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 115.6MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:24:41,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.93ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 112.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:24:41,800 INFO L158 Benchmark]: Boogie Preprocessor took 46.40ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 106.6MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:24:41,800 INFO L158 Benchmark]: IcfgBuilder took 425.48ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 84.9MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:24:41,800 INFO L158 Benchmark]: TraceAbstraction took 83691.38ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 48.9MB in the end (delta: 35.1MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2025-02-05 20:24:41,800 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 167.8MB. Free memory was 48.9MB in the beginning and 48.8MB in the end (delta: 50.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:24:41,801 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.43ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.00ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 115.6MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.93ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 112.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.40ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 106.6MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 425.48ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 84.9MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 83691.38ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 48.9MB in the end (delta: 35.1MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 167.8MB. Free memory was 48.9MB in the beginning and 48.8MB in the end (delta: 50.8kB). Peak memory consumption was 8.4MB. 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 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 123. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 1; [L23] unsigned char var_1_4 = 25; [L24] unsigned short int var_1_5 = 0; [L25] unsigned short int var_1_6 = 62100; [L26] unsigned short int var_1_7 = 27651; [L27] double var_1_8 = 128.9; [L28] double var_1_10 = 16.5; [L29] double var_1_11 = 25.5; [L30] double var_1_12 = 199.75; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 1; [L33] unsigned char var_1_15 = 1; [L34] unsigned char var_1_16 = 1; [L35] unsigned short int var_1_17 = 32; [L36] unsigned char var_1_18 = 1; [L37] unsigned long int var_1_19 = 1; [L38] unsigned short int last_1_var_1_5 = 0; [L39] unsigned char last_1_var_1_15 = 1; [L40] unsigned char last_1_var_1_18 = 1; [L41] unsigned long int last_1_var_1_19 = 1; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L117] last_1_var_1_5 = var_1_5 [L118] last_1_var_1_15 = var_1_15 [L119] last_1_var_1_18 = var_1_18 [L120] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L95] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L95] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L96] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L96] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L97] var_1_6 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L98] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L99] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L99] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L100] var_1_7 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L101] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L102] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L102] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L103] var_1_10 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L104] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L105] var_1_11 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L106] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L107] var_1_12 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L108] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L109] var_1_14 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L110] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L111] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L111] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L112] var_1_16 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L113] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L114] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L114] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L131] RET updateVariables() [L132] CALL step() [L45] COND TRUE \read(last_1_var_1_18) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L46] COND TRUE (! last_1_var_1_15) || (last_1_var_1_19 < var_1_6) [L47] var_1_8 = ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L54] COND TRUE var_1_12 != var_1_8 [L55] var_1_15 = (! var_1_16) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L59] var_1_17 = var_1_4 [L60] var_1_18 = var_1_16 [L61] var_1_19 = var_1_4 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L62] COND FALSE !((var_1_17 != (16 / var_1_4)) && var_1_15) [L73] var_1_1 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L75] COND FALSE !(var_1_17 < last_1_var_1_5) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L78] COND TRUE ! var_1_15 [L79] var_1_5 = ((((last_1_var_1_5) > ((var_1_7 + var_1_4))) ? (last_1_var_1_5) : ((var_1_7 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L82] COND TRUE var_1_5 != ((var_1_6 / var_1_4) * ((((var_1_5) > (var_1_19)) ? (var_1_5) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L83] COND TRUE var_1_5 <= var_1_6 [L84] var_1_13 = 32 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return (((((((((var_1_17 != (16 / var_1_4)) && var_1_15) ? ((var_1_17 > var_1_4) ? (var_1_1 == ((unsigned short int) (var_1_4 + var_1_17))) : (var_1_15 ? (var_1_1 == ((unsigned short int) var_1_17)) : (var_1_1 == ((unsigned short int) var_1_4)))) : (var_1_1 == ((unsigned short int) var_1_17))) && ((var_1_17 < last_1_var_1_5) ? (var_1_5 == ((unsigned short int) (var_1_6 - (var_1_7 - last_1_var_1_5)))) : ((! var_1_15) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_5) > ((var_1_7 + var_1_4))) ? (last_1_var_1_5) : ((var_1_7 + var_1_4)))))) : 1))) && (last_1_var_1_18 ? (((! last_1_var_1_15) || (last_1_var_1_19 < var_1_6)) ? (var_1_8 == ((double) ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))))) : (var_1_8 == ((double) (var_1_11 + var_1_12)))) : (var_1_8 == ((double) var_1_11)))) && ((var_1_5 != ((var_1_6 / var_1_4) * ((((var_1_5) > (var_1_19)) ? (var_1_5) : (var_1_19))))) ? ((var_1_5 <= var_1_6) ? (var_1_13 == ((unsigned char) 32)) : (var_1_13 == ((unsigned char) var_1_14))) : (var_1_13 == ((unsigned char) var_1_14)))) && ((var_1_12 != var_1_8) ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && (var_1_17 == ((unsigned short int) var_1_4))) && (var_1_18 == ((unsigned char) var_1_16))) && (var_1_19 == ((unsigned long int) var_1_4)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 83.6s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 814 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 553 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 261 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 32.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=4, InterpolantAutomatonStates: 35, 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, 4 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 76.0s InterpolantComputationTime, 755 NumberOfCodeBlocks, 755 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 2243 SizeOfPredicates, 7 NumberOfNonLiveVariables, 492 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1689/1820 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 20:24:42,008 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-02-05 20:24:42,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.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 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:24:43,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:24:43,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:24:43,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:24:43,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:24:43,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:24:43,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:24:43,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:24:43,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:24:43,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:24:43,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:24:43,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:24:43,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:24:43,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:24:43,820 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:24:43,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:24:43,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:24:43,821 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:24:43,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:24:43,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:24:43,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:24:43,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:24:43,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:24:43,822 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:24:43,822 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:24:43,822 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:24:43,822 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:24:43,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:24:43,822 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:24:43,822 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:24:43,822 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:24:43,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:24:43,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:24:43,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:24:43,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:24:43,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:24:43,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:24:43,823 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:24:43,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:24:43,823 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:24:43,824 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:24:43,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:24:43,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:24:43,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:24:43,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:24:43,824 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 -> 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 [2025-02-05 20:24:44,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:24:44,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:24:44,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:24:44,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:24:44,094 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:24:44,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2025-02-05 20:24:45,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cdfc99e8/6ea594c1ee964dc5a9848a19d170929e/FLAG0b53d2f4b [2025-02-05 20:24:45,427 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:24:45,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2025-02-05 20:24:45,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cdfc99e8/6ea594c1ee964dc5a9848a19d170929e/FLAG0b53d2f4b [2025-02-05 20:24:45,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cdfc99e8/6ea594c1ee964dc5a9848a19d170929e [2025-02-05 20:24:45,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:24:45,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:24:45,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:24:45,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:24:45,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:24:45,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:24:45" (1/1) ... [2025-02-05 20:24:45,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e8e615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:45, skipping insertion in model container [2025-02-05 20:24:45,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:24:45" (1/1) ... [2025-02-05 20:24:45,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:24:45,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2025-02-05 20:24:45,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:24:45,969 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:24:45,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2025-02-05 20:24:45,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:24:46,003 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:24:46,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46 WrapperNode [2025-02-05 20:24:46,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:24:46,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:24:46,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:24:46,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:24:46,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,044 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-02-05 20:24:46,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:24:46,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:24:46,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:24:46,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:24:46,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,067 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:24:46,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:24:46,089 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:24:46,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:24:46,089 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:24:46,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (1/1) ... [2025-02-05 20:24:46,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:24:46,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:24:46,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:24:46,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:24:46,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:24:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:24:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:24:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:24:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:24:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:24:46,187 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:24:46,188 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:24:46,654 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:24:46,654 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:24:46,660 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:24:46,660 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:24:46,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:24:46 BoogieIcfgContainer [2025-02-05 20:24:46,660 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:24:46,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:24:46,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:24:46,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:24:46,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:24:45" (1/3) ... [2025-02-05 20:24:46,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a99f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:24:46, skipping insertion in model container [2025-02-05 20:24:46,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:24:46" (2/3) ... [2025-02-05 20:24:46,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a99f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:24:46, skipping insertion in model container [2025-02-05 20:24:46,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:24:46" (3/3) ... [2025-02-05 20:24:46,666 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-59.i [2025-02-05 20:24:46,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:24:46,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-59.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:24:46,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:24:46,717 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;@39927195, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:24:46,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:24:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 20:24:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 20:24:46,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:24:46,725 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:24:46,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:24:46,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:24:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1203039355, now seen corresponding path program 1 times [2025-02-05 20:24:46,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:24:46,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689452374] [2025-02-05 20:24:46,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:24:46,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:24:46,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:24:46,740 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:24:46,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 20:24:46,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 20:24:46,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 20:24:46,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:24:46,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:24:46,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:24:46,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:24:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-05 20:24:46,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:24:46,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:24:46,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689452374] [2025-02-05 20:24:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689452374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:24:46,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:24:46,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:24:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980315003] [2025-02-05 20:24:46,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:24:46,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:24:46,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:24:47,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:24:47,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:24:47,005 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 20:24:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:24:47,022 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2025-02-05 20:24:47,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:24:47,023 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-02-05 20:24:47,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:24:47,027 INFO L225 Difference]: With dead ends: 96 [2025-02-05 20:24:47,027 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 20:24:47,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:24:47,030 INFO L435 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:24:47,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:24:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 20:24:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-05 20:24:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 20:24:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-02-05 20:24:47,052 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 93 [2025-02-05 20:24:47,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:24:47,052 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-02-05 20:24:47,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 20:24:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-02-05 20:24:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 20:24:47,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:24:47,056 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:24:47,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 20:24:47,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:24:47,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:24:47,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:24:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1144901407, now seen corresponding path program 1 times [2025-02-05 20:24:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:24:47,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102186154] [2025-02-05 20:24:47,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:24:47,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:24:47,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:24:47,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:24:47,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 20:24:47,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 20:24:47,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 20:24:47,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:24:47,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:24:47,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 20:24:47,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:24:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 20:24:47,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:24:47,619 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:24:47,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102186154] [2025-02-05 20:24:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102186154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:24:47,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:24:47,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:24:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428715332] [2025-02-05 20:24:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:24:47,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:24:47,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:24:47,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:24:47,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:24:47,620 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 20:24:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:24:48,217 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2025-02-05 20:24:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:24:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-02-05 20:24:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:24:48,227 INFO L225 Difference]: With dead ends: 139 [2025-02-05 20:24:48,227 INFO L226 Difference]: Without dead ends: 94 [2025-02-05 20:24:48,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:24:48,228 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 46 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:24:48,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 197 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:24:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-05 20:24:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2025-02-05 20:24:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 20:24:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2025-02-05 20:24:48,243 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 93 [2025-02-05 20:24:48,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:24:48,243 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2025-02-05 20:24:48,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 20:24:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2025-02-05 20:24:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 20:24:48,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:24:48,245 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:24:48,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 20:24:48,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:24:48,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:24:48,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:24:48,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1221135147, now seen corresponding path program 1 times [2025-02-05 20:24:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:24:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575080596] [2025-02-05 20:24:48,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:24:48,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:24:48,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:24:48,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:24:48,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 20:24:48,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 20:24:48,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 20:24:48,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:24:48,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:24:48,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 20:24:48,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:24:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 20:24:48,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:24:48,771 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:24:48,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575080596] [2025-02-05 20:24:48,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575080596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:24:48,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:24:48,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:24:48,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571342417] [2025-02-05 20:24:48,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:24:48,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:24:48,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:24:48,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:24:48,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:24:48,773 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 20:24:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:24:49,456 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2025-02-05 20:24:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:24:49,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-02-05 20:24:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:24:49,469 INFO L225 Difference]: With dead ends: 176 [2025-02-05 20:24:49,469 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 20:24:49,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:24:49,470 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:24:49,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 196 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:24:49,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 20:24:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2025-02-05 20:24:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 20:24:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2025-02-05 20:24:49,491 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 94 [2025-02-05 20:24:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:24:49,492 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2025-02-05 20:24:49,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 20:24:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2025-02-05 20:24:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 20:24:49,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:24:49,494 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:24:49,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 20:24:49,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:24:49,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:24:49,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:24:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1951714493, now seen corresponding path program 1 times [2025-02-05 20:24:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:24:49,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504182917] [2025-02-05 20:24:49,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:24:49,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:24:49,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:24:49,700 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:24:49,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 20:24:49,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 20:24:49,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 20:24:49,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:24:49,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:24:49,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 20:24:49,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:24:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 183 proven. 90 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-05 20:24:51,319 INFO L312 TraceCheckSpWp]: Computing backward predicates...