./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:24:20,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:24:20,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:24:20,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:24:20,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:24:20,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:24:20,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:24:20,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:24:20,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:24:20,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:24:20,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:24:20,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:24:20,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:24:20,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:24:20,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:24:20,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:24:20,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:24:20,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:24:20,417 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/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 -> 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a [2025-03-04 00:24:20,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:24:20,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:24:20,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:24:20,616 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:24:20,616 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:24:20,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i [2025-03-04 00:24:21,743 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e694f0d/f791211074d1457e89205612b57373be/FLAG3143bc776 [2025-03-04 00:24:21,976 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:24:21,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i [2025-03-04 00:24:21,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e694f0d/f791211074d1457e89205612b57373be/FLAG3143bc776 [2025-03-04 00:24:22,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e694f0d/f791211074d1457e89205612b57373be [2025-03-04 00:24:22,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:24:22,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:24:22,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:24:22,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:24:22,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:24:22,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22, skipping insertion in model container [2025-03-04 00:24:22,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:24:22,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2025-03-04 00:24:22,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:24:22,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:24:22,499 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2025-03-04 00:24:22,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:24:22,520 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:24:22,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22 WrapperNode [2025-03-04 00:24:22,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:24:22,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:24:22,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:24:22,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:24:22,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,554 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-04 00:24:22,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:24:22,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:24:22,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:24:22,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:24:22,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,577 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-03-04 00:24:22,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:24:22,587 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:24:22,587 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:24:22,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:24:22,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (1/1) ... [2025-03-04 00:24:22,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:24:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:24:22,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:24:22,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:24:22,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:24:22,631 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:24:22,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:24:22,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:24:22,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:24:22,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:24:22,681 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:24:22,682 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:24:22,804 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:24:22,804 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:24:22,810 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:24:22,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:24:22,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:24:22 BoogieIcfgContainer [2025-03-04 00:24:22,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:24:22,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:24:22,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:24:22,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:24:22,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:24:22" (1/3) ... [2025-03-04 00:24:22,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441a50da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:24:22, skipping insertion in model container [2025-03-04 00:24:22,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:22" (2/3) ... [2025-03-04 00:24:22,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441a50da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:24:22, skipping insertion in model container [2025-03-04 00:24:22,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:24:22" (3/3) ... [2025-03-04 00:24:22,816 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-62.i [2025-03-04 00:24:22,825 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:24:22,826 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-62.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:24:22,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:24:22,869 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;@55fa078b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:24:22,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:24:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 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-03-04 00:24:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 00:24:22,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:24:22,877 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] [2025-03-04 00:24:22,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:24:22,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:24:22,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1340997727, now seen corresponding path program 1 times [2025-03-04 00:24:22,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:24:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504790706] [2025-03-04 00:24:22,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:24:22,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:24:22,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 00:24:22,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 00:24:22,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:24:22,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:24:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:24:23,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:24:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504790706] [2025-03-04 00:24:23,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504790706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:24:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491304011] [2025-03-04 00:24:23,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:24:23,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:24:23,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:24:23,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:24:23,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:24:23,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 00:24:23,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 00:24:23,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:24:23,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:24:23,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:24:23,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:24:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:24:23,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:24:23,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491304011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:24:23,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:24:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:24:23,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989121026] [2025-03-04 00:24:23,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:24:23,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:24:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:24:23,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:24:23,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:24:23,207 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-03-04 00:24:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:24:23,221 INFO L93 Difference]: Finished difference Result 84 states and 137 transitions. [2025-03-04 00:24:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:24:23,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 91 [2025-03-04 00:24:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:24:23,225 INFO L225 Difference]: With dead ends: 84 [2025-03-04 00:24:23,225 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 00:24:23,227 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-03-04 00:24:23,229 INFO L435 NwaCegarLoop]: 59 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, 59 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-03-04 00:24:23,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:24:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 00:24:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 00:24:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-03-04 00:24:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2025-03-04 00:24:23,251 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 91 [2025-03-04 00:24:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:24:23,251 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-03-04 00:24:23,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-03-04 00:24:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2025-03-04 00:24:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 00:24:23,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:24:23,253 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] [2025-03-04 00:24:23,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:24:23,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:24:23,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:24:23,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:24:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash 814745285, now seen corresponding path program 1 times [2025-03-04 00:24:23,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:24:23,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305932936] [2025-03-04 00:24:23,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:24:23,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:24:23,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 00:24:23,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 00:24:23,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:24:23,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:24:23,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:24:23,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 00:24:23,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 00:24:23,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:24:23,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:24:23,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:24:23,618 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:24:23,619 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:24:23,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:24:23,622 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:24:23,666 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:24:23,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:24:23 BoogieIcfgContainer [2025-03-04 00:24:23,669 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:24:23,670 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:24:23,670 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:24:23,670 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:24:23,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:24:22" (3/4) ... [2025-03-04 00:24:23,673 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:24:23,674 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:24:23,675 INFO L158 Benchmark]: Toolchain (without parser) took 1361.07ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 91.8MB in the end (delta: 13.2MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-03-04 00:24:23,675 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:24:23,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.06ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:24:23,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.04ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:24:23,676 INFO L158 Benchmark]: Boogie Preprocessor took 31.44ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:24:23,676 INFO L158 Benchmark]: IcfgBuilder took 223.12ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 75.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:24:23,677 INFO L158 Benchmark]: TraceAbstraction took 857.49ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 92.6MB in the end (delta: -18.1MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2025-03-04 00:24:23,678 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.8MB in the end (delta: 761.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:24:23,679 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.17ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.06ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.04ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.44ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 223.12ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 75.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 857.49ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 92.6MB in the end (delta: -18.1MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.8MB in the end (delta: 761.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = -128; [L24] unsigned char var_1_3 = 1; [L25] signed char var_1_4 = -5; [L26] unsigned char var_1_5 = 16; [L27] unsigned char var_1_9 = 25; [L28] float var_1_10 = 2.5; [L29] signed char var_1_11 = 1; [L30] signed char var_1_12 = 4; [L31] float var_1_13 = 7.75; [L32] float var_1_14 = 64.75; [L33] float var_1_15 = 256.52; [L34] float var_1_16 = 3.25; VAL [isInitial=0, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L63] var_1_4 = __VERIFIER_nondet_char() [L64] CALL assume_abort_if_not(var_1_4 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_4 >= -126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L69] var_1_11 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L70] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L71] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L72] var_1_12 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L74] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L76] RET assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L77] var_1_14 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L78] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L80] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L82] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L95] RET updateVariables() [L96] CALL step() [L38] var_1_1 = (16 - 2) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_1=14, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L39] COND TRUE \read(var_1_3) [L40] var_1_2 = ((((-4) < 0 ) ? -(-4) : (-4))) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L44] COND FALSE !(var_1_4 < ((16 + var_1_11) - var_1_12)) [L51] var_1_10 = var_1_14 VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=0] [L53] COND TRUE (var_1_10 * var_1_10) > var_1_10 [L54] var_1_5 = (((((25) < (5)) ? (25) : (5))) + 10) VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=15, var_1_9=0] [L96] RET step() [L97] CALL, EXPR property() [L87-L88] return (((var_1_1 == ((signed char) (16 - 2))) && (var_1_3 ? (var_1_2 == ((signed char) ((((-4) < 0 ) ? -(-4) : (-4))))) : (var_1_2 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) && (((var_1_10 * var_1_10) > var_1_10) ? (var_1_5 == ((unsigned char) (((((25) < (5)) ? (25) : (5))) + 10))) : (var_1_5 == ((unsigned char) var_1_9)))) && ((var_1_4 < ((16 + var_1_11) - var_1_12)) ? (var_1_3 ? (var_1_10 == ((float) ((var_1_13 + 50.6f) + var_1_14))) : (var_1_10 == ((float) (var_1_15 - var_1_16)))) : (var_1_10 == ((float) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=261, var_1_11=0, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=15, var_1_9=0] [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=15, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=15, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 59 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 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-03-04 00:24:23,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:24:25,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:24:25,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:24:25,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:24:25,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:24:25,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:24:25,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:24:25,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:24:25,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:24:25,531 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:24:25,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:24:25,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:24:25,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:24:25,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:24:25,532 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:24:25,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:24:25,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:24:25,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:24:25,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:24:25,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:24:25,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:24:25,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:24:25,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:24:25,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:24:25,533 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:24:25,533 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:24:25,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:24:25,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:24:25,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:24:25,533 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:24:25,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:24:25,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:24:25,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:24:25,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:24:25,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:24:25,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:24:25,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:24:25,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:24:25,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:24:25,534 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:24:25,534 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:24:25,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:24:25,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:24:25,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:24:25,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:24:25,535 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/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 -> 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a [2025-03-04 00:24:25,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:24:25,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:24:25,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:24:25,769 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:24:25,770 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:24:25,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i [2025-03-04 00:24:26,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84343ce3/7b99b804d433449399754ab23392199b/FLAG4ee672b72 [2025-03-04 00:24:27,125 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:24:27,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i [2025-03-04 00:24:27,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84343ce3/7b99b804d433449399754ab23392199b/FLAG4ee672b72 [2025-03-04 00:24:27,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84343ce3/7b99b804d433449399754ab23392199b [2025-03-04 00:24:27,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:24:27,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:24:27,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:24:27,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:24:27,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:24:27,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bf1af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27, skipping insertion in model container [2025-03-04 00:24:27,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:24:27,614 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2025-03-04 00:24:27,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:24:27,664 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:24:27,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2025-03-04 00:24:27,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:24:27,713 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:24:27,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27 WrapperNode [2025-03-04 00:24:27,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:24:27,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:24:27,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:24:27,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:24:27,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,750 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-04 00:24:27,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:24:27,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:24:27,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:24:27,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:24:27,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,771 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-03-04 00:24:27,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:24:27,793 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:24:27,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:24:27,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:24:27,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (1/1) ... [2025-03-04 00:24:27,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:24:27,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:24:27,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:24:27,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:24:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:24:27,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:24:27,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:24:27,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:24:27,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:24:27,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:24:27,902 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:24:27,904 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:24:29,139 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:24:29,140 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:24:29,147 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:24:29,147 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:24:29,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:24:29 BoogieIcfgContainer [2025-03-04 00:24:29,148 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:24:29,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:24:29,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:24:29,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:24:29,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:24:27" (1/3) ... [2025-03-04 00:24:29,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f440ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:24:29, skipping insertion in model container [2025-03-04 00:24:29,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:27" (2/3) ... [2025-03-04 00:24:29,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f440ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:24:29, skipping insertion in model container [2025-03-04 00:24:29,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:24:29" (3/3) ... [2025-03-04 00:24:29,155 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-62.i [2025-03-04 00:24:29,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:24:29,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-62.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:24:29,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:24:29,210 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;@335ba13d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:24:29,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:24:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 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-03-04 00:24:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 00:24:29,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:24:29,220 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] [2025-03-04 00:24:29,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:24:29,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:24:29,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1340997727, now seen corresponding path program 1 times [2025-03-04 00:24:29,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:24:29,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973046363] [2025-03-04 00:24:29,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:24:29,233 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-03-04 00:24:29,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:24:29,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-04 00:24:29,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 00:24:29,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 00:24:29,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 00:24:29,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:24:29,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:24:29,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:24:29,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:24:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-04 00:24:29,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:24:29,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:24:29,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973046363] [2025-03-04 00:24:29,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973046363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:24:29,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:24:29,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:24:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136180156] [2025-03-04 00:24:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:24:29,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:24:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:24:29,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:24:29,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:24:29,492 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 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), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:24:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:24:29,508 INFO L93 Difference]: Finished difference Result 84 states and 137 transitions. [2025-03-04 00:24:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:24:29,509 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), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2025-03-04 00:24:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:24:29,513 INFO L225 Difference]: With dead ends: 84 [2025-03-04 00:24:29,513 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 00:24:29,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-03-04 00:24:29,516 INFO L435 NwaCegarLoop]: 59 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, 59 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-03-04 00:24:29,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:24:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 00:24:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 00:24:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-03-04 00:24:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2025-03-04 00:24:29,537 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 91 [2025-03-04 00:24:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:24:29,538 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-03-04 00:24:29,538 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), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:24:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2025-03-04 00:24:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 00:24:29,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:24:29,542 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] [2025-03-04 00:24:29,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 00:24:29,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-04 00:24:29,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:24:29,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:24:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash 814745285, now seen corresponding path program 1 times [2025-03-04 00:24:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:24:29,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076961141] [2025-03-04 00:24:29,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:24:29,744 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-03-04 00:24:29,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:24:29,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-04 00:24:29,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 00:24:29,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 00:24:29,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 00:24:29,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:24:29,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:24:29,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:24:29,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:24:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 00:24:54,935 INFO L312 TraceCheckSpWp]: Computing backward predicates...