./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.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_amount10_file-32.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 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:08,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:08,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:04:08,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:08,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:08,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:08,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:08,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:08,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:08,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:08,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:08,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:08,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:08,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:08,379 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:08,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:08,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:08,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:08,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:04:08,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:08,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:08,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:08,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:08,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:08,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:08,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:08,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:08,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:08,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:08,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:08,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:08,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:08,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:08,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:08,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:08,381 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:08,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:08,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:04:08,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:04:08,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:08,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:08,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:08,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:08,382 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 -> 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e [2025-03-04 00:04:08,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:08,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:08,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:08,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:08,581 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:08,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2025-03-04 00:04:09,710 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84a5fd25/fdb0cca871dd47bfbc2a43ad2c61e11b/FLAG0aae323b1 [2025-03-04 00:04:09,900 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:09,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2025-03-04 00:04:09,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84a5fd25/fdb0cca871dd47bfbc2a43ad2c61e11b/FLAG0aae323b1 [2025-03-04 00:04:10,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84a5fd25/fdb0cca871dd47bfbc2a43ad2c61e11b [2025-03-04 00:04:10,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:10,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:10,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:10,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:10,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:10,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669535a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10, skipping insertion in model container [2025-03-04 00:04:10,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:10,377 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_amount10_file-32.i[915,928] [2025-03-04 00:04:10,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:10,421 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:10,428 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_amount10_file-32.i[915,928] [2025-03-04 00:04:10,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:10,454 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:10,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10 WrapperNode [2025-03-04 00:04:10,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:10,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:10,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:10,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:10,460 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:04:10" (1/1) ... [2025-03-04 00:04:10,465 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:04:10" (1/1) ... [2025-03-04 00:04:10,479 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 64 [2025-03-04 00:04:10,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:10,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:10,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:10,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:10,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,496 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:04:10,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,499 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:10,506 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:10,506 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:10,506 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:10,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (1/1) ... [2025-03-04 00:04:10,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:10,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:10,534 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:04:10,537 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:04:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:10,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:04:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:10,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:10,597 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:10,599 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:10,718 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:10,718 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:10,724 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:10,726 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:10,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:10 BoogieIcfgContainer [2025-03-04 00:04:10,726 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:10,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:10,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:10,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:10,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:10" (1/3) ... [2025-03-04 00:04:10,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b724ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:10, skipping insertion in model container [2025-03-04 00:04:10,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:10" (2/3) ... [2025-03-04 00:04:10,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b724ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:10, skipping insertion in model container [2025-03-04 00:04:10,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:10" (3/3) ... [2025-03-04 00:04:10,733 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-32.i [2025-03-04 00:04:10,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:10,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-32.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:10,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:10,782 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;@1a5ddf69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:10,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:04:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 00:04:10,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:10,789 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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:04:10,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:10,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:10,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1408199889, now seen corresponding path program 1 times [2025-03-04 00:04:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464764325] [2025-03-04 00:04:10,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:10,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:04:10,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:04:10,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:10,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 00:04:10,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:04:10,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464764325] [2025-03-04 00:04:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464764325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:04:10,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395790888] [2025-03-04 00:04:10,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:10,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:04:10,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:10,922 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:04:10,924 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:04:10,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:04:11,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:04:11,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:11,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:11,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:11,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 00:04:11,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395790888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:11,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:04:11,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:04:11,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105983787] [2025-03-04 00:04:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:11,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:11,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:04:11,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:11,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:11,048 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:04:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:11,059 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-03-04 00:04:11,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2025-03-04 00:04:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:11,064 INFO L225 Difference]: With dead ends: 56 [2025-03-04 00:04:11,065 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 00:04:11,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 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:04:11,068 INFO L435 NwaCegarLoop]: 35 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, 35 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:04:11,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 00:04:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 00:04:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:04:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-04 00:04:11,092 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 50 [2025-03-04 00:04:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:11,093 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-04 00:04:11,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:04:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-04 00:04:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 00:04:11,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:11,096 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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:04:11,102 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:04:11,296 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:04:11,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:11,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1228760654, now seen corresponding path program 1 times [2025-03-04 00:04:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:11,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780346770] [2025-03-04 00:04:11,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:11,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:11,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:04:11,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:04:11,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:11,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:11,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:04:11,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:04:11,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:04:11,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:11,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:11,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:04:11,419 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:04:11,420 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:04:11,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:04:11,424 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:04:11,448 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:04:11,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:04:11 BoogieIcfgContainer [2025-03-04 00:04:11,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:04:11,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:04:11,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:04:11,452 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:04:11,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:10" (3/4) ... [2025-03-04 00:04:11,454 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:04:11,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:04:11,455 INFO L158 Benchmark]: Toolchain (without parser) took 1192.38ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 82.8MB in the end (delta: 71.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 00:04:11,456 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:11,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.33ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 142.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:11,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.27ms. Allocated memory is still 201.3MB. Free memory was 142.4MB in the beginning and 140.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:11,457 INFO L158 Benchmark]: Boogie Preprocessor took 25.76ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 138.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:11,457 INFO L158 Benchmark]: IcfgBuilder took 220.19ms. Allocated memory is still 201.3MB. Free memory was 138.3MB in the beginning and 124.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:04:11,457 INFO L158 Benchmark]: TraceAbstraction took 722.91ms. Allocated memory is still 201.3MB. Free memory was 124.0MB in the beginning and 83.0MB in the end (delta: 40.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 00:04:11,458 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 201.3MB. Free memory was 83.0MB in the beginning and 82.8MB in the end (delta: 174.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:11,459 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.18ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.33ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 142.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.27ms. Allocated memory is still 201.3MB. Free memory was 142.4MB in the beginning and 140.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.76ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 138.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 220.19ms. Allocated memory is still 201.3MB. Free memory was 138.3MB in the beginning and 124.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 722.91ms. Allocated memory is still 201.3MB. Free memory was 124.0MB in the beginning and 83.0MB in the end (delta: 40.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 201.3MB. Free memory was 83.0MB in the beginning and 82.8MB in the end (delta: 174.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned char var_1_2 = 1; [L24] signed short int var_1_5 = -32475; [L25] float var_1_7 = 7.2; [L26] float var_1_8 = 500.4; [L27] unsigned char var_1_9 = 10; [L28] unsigned char var_1_10 = 16; [L29] unsigned short int var_1_11 = 4; VAL [isInitial=0, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L60] isInitial = 1 [L61] FCALL initially() [L62] COND TRUE 1 [L63] FCALL updateLastVariables() [L64] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_uchar() [L42] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L42] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L43] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L43] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L44] var_1_5 = __VERIFIER_nondet_short() [L45] CALL assume_abort_if_not(var_1_5 >= -32766) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L45] RET assume_abort_if_not(var_1_5 >= -32766) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L46] CALL assume_abort_if_not(var_1_5 <= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L46] RET assume_abort_if_not(var_1_5 <= -16383) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L47] var_1_8 = __VERIFIER_nondet_float() [L48] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_9=10] [L48] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_9=10] [L49] var_1_10 = __VERIFIER_nondet_uchar() [L50] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_9=10] [L50] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_9=10] [L51] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_9=10] [L51] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=36/5, var_1_9=10] [L64] RET updateVariables() [L65] CALL step() [L33] var_1_7 = var_1_8 [L34] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32766, var_1_7=505, var_1_8=505, var_1_9=0] [L35] COND TRUE \read(var_1_2) [L36] var_1_1 = ((((((var_1_9 + 16)) > (var_1_9)) ? ((var_1_9 + 16)) : (var_1_9))) - (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) - var_1_9)) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_1=-32750, var_1_2=1, var_1_5=-32766, var_1_7=505, var_1_8=505, var_1_9=0] [L38] var_1_11 = var_1_1 VAL [isInitial=1, var_1_10=0, var_1_11=-32750, var_1_1=-32750, var_1_2=1, var_1_5=-32766, var_1_7=505, var_1_8=505, var_1_9=0] [L65] RET step() [L66] CALL, EXPR property() [L56-L57] return (((var_1_2 ? (var_1_1 == ((signed short int) ((((((var_1_9 + 16)) > (var_1_9)) ? ((var_1_9 + 16)) : (var_1_9))) - (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) - var_1_9)))) : 1) && (var_1_7 == ((float) var_1_8))) && (var_1_9 == ((unsigned char) var_1_10))) && (var_1_11 == ((unsigned short int) var_1_1)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=-32750, var_1_1=-32750, var_1_2=1, var_1_5=-32766, var_1_7=505, var_1_8=505, var_1_9=0] [L66] RET, EXPR property() [L66] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=-32750, var_1_1=-32750, var_1_2=1, var_1_5=-32766, var_1_7=505, var_1_8=505, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=-32750, var_1_1=-32750, var_1_2=1, var_1_5=-32766, var_1_7=505, var_1_8=505, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 7, 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, 35 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, 35 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 98 SizeOfPredicates, 0 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 156/168 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:04:11,474 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_amount10_file-32.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 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:13,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:13,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:04:13,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:13,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:13,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:13,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:13,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:13,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:13,325 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:13,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:13,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:13,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:13,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:13,327 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:13,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:13,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:13,327 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:13,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:13,328 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:13,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:13,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:13,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:13,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:13,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:13,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:13,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:13,329 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:13,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:13,330 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:04:13,330 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:04:13,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:13,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:13,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:13,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:13,330 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 -> 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e [2025-03-04 00:04:13,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:13,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:13,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:13,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:13,588 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:13,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2025-03-04 00:04:14,748 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e36f11eb/9a7173fb26f8464cba169b891834be1f/FLAG05a5c0c95 [2025-03-04 00:04:14,947 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:14,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2025-03-04 00:04:14,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e36f11eb/9a7173fb26f8464cba169b891834be1f/FLAG05a5c0c95 [2025-03-04 00:04:15,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e36f11eb/9a7173fb26f8464cba169b891834be1f [2025-03-04 00:04:15,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:15,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:15,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:15,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:15,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:15,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d5235eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15, skipping insertion in model container [2025-03-04 00:04:15,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:15,434 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_amount10_file-32.i[915,928] [2025-03-04 00:04:15,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:15,487 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:15,495 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_amount10_file-32.i[915,928] [2025-03-04 00:04:15,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:15,526 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:15,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15 WrapperNode [2025-03-04 00:04:15,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:15,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:15,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:15,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:15,535 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:04:15" (1/1) ... [2025-03-04 00:04:15,543 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:04:15" (1/1) ... [2025-03-04 00:04:15,557 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 63 [2025-03-04 00:04:15,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:15,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:15,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:15,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:15,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,584 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:04:15,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,594 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:15,602 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:15,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:15,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:15,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (1/1) ... [2025-03-04 00:04:15,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:15,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:15,633 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:04:15,636 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:04:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:04:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:15,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:15,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:15,701 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:15,702 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:15,860 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:15,861 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:15,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:15,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:15,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:15 BoogieIcfgContainer [2025-03-04 00:04:15,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:15,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:15,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:15,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:15,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:15" (1/3) ... [2025-03-04 00:04:15,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57feb7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:15, skipping insertion in model container [2025-03-04 00:04:15,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:15" (2/3) ... [2025-03-04 00:04:15,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57feb7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:15, skipping insertion in model container [2025-03-04 00:04:15,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:15" (3/3) ... [2025-03-04 00:04:15,878 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-32.i [2025-03-04 00:04:15,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:15,891 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-32.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:15,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:15,951 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;@268168b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:15,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:04:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 00:04:15,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:15,961 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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:04:15,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:15,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1408199889, now seen corresponding path program 1 times [2025-03-04 00:04:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:15,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837783378] [2025-03-04 00:04:15,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:15,976 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:04:15,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:15,978 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:04:15,979 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:04:16,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:04:16,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:04:16,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:16,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:16,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:16,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 00:04:16,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:16,132 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:16,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837783378] [2025-03-04 00:04:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837783378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:16,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:16,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:04:16,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023416645] [2025-03-04 00:04:16,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:16,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:16,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:16,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:16,154 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:04:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:16,166 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-03-04 00:04:16,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:16,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2025-03-04 00:04:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:16,175 INFO L225 Difference]: With dead ends: 56 [2025-03-04 00:04:16,175 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 00:04:16,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 49 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:04:16,179 INFO L435 NwaCegarLoop]: 35 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, 35 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:04:16,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 00:04:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 00:04:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:04:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-04 00:04:16,210 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 50 [2025-03-04 00:04:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:16,210 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-04 00:04:16,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:04:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-04 00:04:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 00:04:16,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:16,212 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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:04:16,218 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-04 00:04:16,413 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:04:16,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:16,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:16,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1228760654, now seen corresponding path program 1 times [2025-03-04 00:04:16,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:16,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812104971] [2025-03-04 00:04:16,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:16,414 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:04:16,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:16,416 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:04:16,418 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:04:16,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:04:16,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:04:16,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:16,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:16,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:04:16,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 00:04:25,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:04:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 00:04:28,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:28,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812104971] [2025-03-04 00:04:28,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812104971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:04:28,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:04:28,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-04 00:04:28,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11472201] [2025-03-04 00:04:28,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:04:28,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:04:28,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:28,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:04:28,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:04:28,328 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 00:04:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:29,284 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-03-04 00:04:29,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 00:04:29,285 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 50 [2025-03-04 00:04:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:29,286 INFO L225 Difference]: With dead ends: 66 [2025-03-04 00:04:29,286 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 00:04:29,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 00:04:29,287 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 77 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:04:29,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 134 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:04:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 00:04:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2025-03-04 00:04:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 40 states have internal predecessors, (40), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 00:04:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-03-04 00:04:29,296 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 50 [2025-03-04 00:04:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:29,296 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-03-04 00:04:29,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 00:04:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-03-04 00:04:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 00:04:29,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:29,298 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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:04:29,303 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 (3)] Ended with exit code 0 [2025-03-04 00:04:29,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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:04:29,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:29,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1200131503, now seen corresponding path program 1 times [2025-03-04 00:04:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:29,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746896886] [2025-03-04 00:04:29,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:29,499 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:04:29,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:29,502 INFO L229 MonitoredProcess]: Starting monitored process 4 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:04:29,503 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 (4)] Waiting until timeout for monitored process [2025-03-04 00:04:29,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:04:29,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:04:29,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:29,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:29,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:04:29,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 00:04:33,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:04:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 00:04:42,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746896886] [2025-03-04 00:04:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746896886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:04:42,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:04:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-04 00:04:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117341269] [2025-03-04 00:04:42,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:04:42,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:04:42,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:42,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:04:42,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:04:42,774 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 00:04:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:45,277 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2025-03-04 00:04:45,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:04:45,278 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 50 [2025-03-04 00:04:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:45,278 INFO L225 Difference]: With dead ends: 63 [2025-03-04 00:04:45,278 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:04:45,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:04:45,280 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 59 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:04:45,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 193 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 00:04:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:04:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:04:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 00:04:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:04:45,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2025-03-04 00:04:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:45,280 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:04:45,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 00:04:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:04:45,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:04:45,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:04:45,288 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 (4)] Ended with exit code 0 [2025-03-04 00:04:45,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:04:45,486 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:04:45,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:04:46,620 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:04:46,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:04:46,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:04:46,633 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:04:46,633 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:04:46,633 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:04:46,633 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:04:46,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:04:46 BoogieIcfgContainer [2025-03-04 00:04:46,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:04:46,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:04:46,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:04:46,634 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:04:46,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:15" (3/4) ... [2025-03-04 00:04:46,641 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:04:46,645 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:04:46,648 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 00:04:46,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:04:46,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:04:46,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:04:46,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:04:46,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:04:46,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:04:46,716 INFO L158 Benchmark]: Toolchain (without parser) took 31400.76ms. Allocated memory was 117.4MB in the beginning and 956.3MB in the end (delta: 838.9MB). Free memory was 91.0MB in the beginning and 428.0MB in the end (delta: -337.0MB). Peak memory consumption was 500.9MB. Max. memory is 16.1GB. [2025-03-04 00:04:46,717 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:46,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.47ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 78.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:46,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.71ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:46,717 INFO L158 Benchmark]: Boogie Preprocessor took 41.87ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 75.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:46,718 INFO L158 Benchmark]: IcfgBuilder took 267.65ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 63.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:46,718 INFO L158 Benchmark]: TraceAbstraction took 30761.83ms. Allocated memory was 117.4MB in the beginning and 956.3MB in the end (delta: 838.9MB). Free memory was 62.9MB in the beginning and 432.4MB in the end (delta: -369.5MB). Peak memory consumption was 475.7MB. Max. memory is 16.1GB. [2025-03-04 00:04:46,719 INFO L158 Benchmark]: Witness Printer took 81.46ms. Allocated memory is still 956.3MB. Free memory was 432.4MB in the beginning and 428.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:46,720 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.14ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.47ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 78.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.71ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.87ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 75.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 267.65ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 63.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30761.83ms. Allocated memory was 117.4MB in the beginning and 956.3MB in the end (delta: 838.9MB). Free memory was 62.9MB in the beginning and 432.4MB in the end (delta: -369.5MB). Peak memory consumption was 475.7MB. Max. memory is 16.1GB. * Witness Printer took 81.46ms. Allocated memory is still 956.3MB. Free memory was 432.4MB in the beginning and 428.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 362 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 264 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 411 IncrementalHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 98 mSDtfsCounter, 411 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=2, InterpolantAutomatonStates: 39, 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, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 245 ConstructedInterpolants, 3 QuantifiedInterpolants, 6947 SizeOfPredicates, 26 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 328/420 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 00:04:46,807 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 Writing output log to file Ultimate.log Result: TRUE