./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-17.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 21420ec07872ebdf13b6707327ac11dfce6dd5da26c087213f4c675ac808eb5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:21:41,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:21:41,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:21:41,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:21:41,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:21:41,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:21:41,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:21:41,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:21:41,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:21:41,492 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:21:41,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:21:41,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:21:41,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:21:41,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:21:41,493 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:21:41,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:21:41,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:21:41,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:41,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:21:41,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:21:41,495 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 -> 21420ec07872ebdf13b6707327ac11dfce6dd5da26c087213f4c675ac808eb5c [2025-03-17 04:21:41,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:21:41,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:21:41,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:21:41,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:21:41,709 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:21:41,710 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-17.i [2025-03-17 04:21:42,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ab156b4/0e16cdb7a8674409bbe5dbdf945bfe30/FLAG79105526f [2025-03-17 04:21:43,062 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:21:43,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-17.i [2025-03-17 04:21:43,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ab156b4/0e16cdb7a8674409bbe5dbdf945bfe30/FLAG79105526f [2025-03-17 04:21:43,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ab156b4/0e16cdb7a8674409bbe5dbdf945bfe30 [2025-03-17 04:21:43,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:21:43,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:21:43,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:43,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:21:43,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:21:43,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b79a7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43, skipping insertion in model container [2025-03-17 04:21:43,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:21:43,500 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-17.i[915,928] [2025-03-17 04:21:43,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:43,540 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:21:43,547 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-17.i[915,928] [2025-03-17 04:21:43,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:43,569 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:21:43,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43 WrapperNode [2025-03-17 04:21:43,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:43,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:43,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:21:43,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:21:43,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,592 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-03-17 04:21:43,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:43,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:21:43,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:21:43,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:21:43,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,611 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-17 04:21:43,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:21:43,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:21:43,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:21:43,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:21:43,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (1/1) ... [2025-03-17 04:21:43,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:43,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:21:43,648 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-17 04:21:43,657 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-17 04:21:43,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:21:43,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:21:43,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:21:43,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:21:43,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:21:43,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:21:43,715 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:21:43,716 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:21:43,864 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:21:43,864 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:21:43,870 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:21:43,871 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:21:43,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:43 BoogieIcfgContainer [2025-03-17 04:21:43,872 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:21:43,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:21:43,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:21:43,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:21:43,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:21:43" (1/3) ... [2025-03-17 04:21:43,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed0411e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:21:43, skipping insertion in model container [2025-03-17 04:21:43,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:43" (2/3) ... [2025-03-17 04:21:43,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed0411e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:21:43, skipping insertion in model container [2025-03-17 04:21:43,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:43" (3/3) ... [2025-03-17 04:21:43,878 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-17.i [2025-03-17 04:21:43,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:21:43,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-17.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:21:43,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:21:43,932 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;@54a55d44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:21:43,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:21:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 04:21:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 04:21:43,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:43,940 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:43,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:43,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:43,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1806824187, now seen corresponding path program 1 times [2025-03-17 04:21:43,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:21:43,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562544470] [2025-03-17 04:21:43,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:43,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:21:44,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 04:21:44,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 04:21:44,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:44,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 04:21:44,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:21:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562544470] [2025-03-17 04:21:44,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562544470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:21:44,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774437802] [2025-03-17 04:21:44,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:44,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:21:44,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:21:44,090 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-17 04:21:44,091 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-17 04:21:44,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 04:21:44,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 04:21:44,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:44,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:44,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:21:44,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:21:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 04:21:44,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:21:44,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774437802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:21:44,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:21:44,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:21:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507280719] [2025-03-17 04:21:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:21:44,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:21:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:21:44,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:21:44,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:21:44,214 INFO L87 Difference]: Start difference. First operand has 38 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 04:21:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:21:44,227 INFO L93 Difference]: Finished difference Result 73 states and 126 transitions. [2025-03-17 04:21:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:21:44,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 83 [2025-03-17 04:21:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:21:44,232 INFO L225 Difference]: With dead ends: 73 [2025-03-17 04:21:44,232 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 04:21:44,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:21:44,235 INFO L435 NwaCegarLoop]: 53 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, 53 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-17 04:21:44,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:21:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 04:21:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-17 04:21:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 04:21:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2025-03-17 04:21:44,259 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 83 [2025-03-17 04:21:44,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:21:44,259 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2025-03-17 04:21:44,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 04:21:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2025-03-17 04:21:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 04:21:44,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:44,262 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:44,269 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-17 04:21:44,463 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-17 04:21:44,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:44,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash 323679491, now seen corresponding path program 1 times [2025-03-17 04:21:44,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:21:44,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231503835] [2025-03-17 04:21:44,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:44,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:21:44,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 04:21:44,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 04:21:44,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:44,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:21:44,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [372086861] [2025-03-17 04:21:44,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:44,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:21:44,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:21:44,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:21:44,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:21:44,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 04:21:44,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 04:21:44,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:44,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:21:44,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:21:44,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 04:21:44,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 04:21:44,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:44,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:21:44,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:21:44,705 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:21:44,706 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:21:44,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:21:44,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 04:21:44,910 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 04:21:44,945 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:21:44,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:21:44 BoogieIcfgContainer [2025-03-17 04:21:44,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:21:44,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:21:44,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:21:44,948 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:21:44,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:43" (3/4) ... [2025-03-17 04:21:44,950 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:21:44,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:21:44,951 INFO L158 Benchmark]: Toolchain (without parser) took 1565.05ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 97.8MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-03-17 04:21:44,952 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:44,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.85ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 99.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:44,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.62ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:44,953 INFO L158 Benchmark]: Boogie Preprocessor took 27.45ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:44,953 INFO L158 Benchmark]: IcfgBuilder took 251.01ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 82.2MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 04:21:44,953 INFO L158 Benchmark]: TraceAbstraction took 1074.59ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 97.8MB in the end (delta: -16.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:44,953 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 97.8MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:44,954 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 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.85ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 99.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.62ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.45ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 251.01ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 82.2MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1074.59ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 97.8MB in the end (delta: -16.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 97.8MB in the end (delta: 27.0kB). 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 75, overapproximation of someBinaryFLOATComparisonOperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.6; [L23] signed char var_1_2 = 5; [L24] signed char var_1_3 = -25; [L25] signed long int var_1_4 = -8; [L26] unsigned char var_1_5 = 1; [L27] signed long int var_1_6 = 256; [L28] unsigned char var_1_7 = 0; [L29] float var_1_8 = 4.6; [L79] isInitial = 1 [L80] FCALL initially() [L81] COND TRUE 1 [L82] FCALL updateLastVariables() [L83] CALL updateVariables() [L50] var_1_2 = __VERIFIER_nondet_char() [L51] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L51] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L52] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L52] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L53] var_1_3 = __VERIFIER_nondet_char() [L54] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L54] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L55] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L55] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L56] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L56] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L57] var_1_4 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L58] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L59] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L59] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L60] var_1_5 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_6=256, var_1_7=0, var_1_8=23/5] [L61] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_6=256, var_1_7=0, var_1_8=23/5] [L62] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L62] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L63] var_1_6 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=23/5] [L64] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=23/5] [L65] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=23/5] [L65] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=23/5] [L66] var_1_7 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=23/5] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=23/5] [L68] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=23/5] [L68] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=23/5] [L69] var_1_8 = __VERIFIER_nondet_float() [L70] 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_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=-255] [L70] 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_1=18/5, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=-255] [L83] RET updateVariables() [L84] CALL step() [L33] COND FALSE !((var_1_2 / var_1_3) < var_1_4) [L46] var_1_1 = var_1_8 VAL [isInitial=1, var_1_1=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=2] [L84] RET step() [L85] CALL, EXPR property() [L75-L76] return ((var_1_2 / var_1_3) < var_1_4) ? (var_1_5 ? ((var_1_4 <= ((((var_1_3) < ((var_1_2 * var_1_6))) ? (var_1_3) : ((var_1_2 * var_1_6))))) ? (var_1_7 ? (var_1_1 == ((float) var_1_8)) : (var_1_1 == ((float) var_1_8))) : (var_1_1 == ((float) var_1_8))) : 1) : (var_1_1 == ((float) var_1_8)) ; [L85] RET, EXPR property() [L85] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=2] [L19] reach_error() VAL [isInitial=1, var_1_1=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=-255, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 71 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 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, 53 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 04:21:44,967 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-17.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 21420ec07872ebdf13b6707327ac11dfce6dd5da26c087213f4c675ac808eb5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:21:46,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:21:46,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:21:46,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:21:46,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:21:46,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:21:46,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:21:46,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:21:46,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:21:46,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:21:46,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:21:46,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:21:46,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:21:46,867 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:21:46,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:46,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:21:46,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:21:46,868 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 -> 21420ec07872ebdf13b6707327ac11dfce6dd5da26c087213f4c675ac808eb5c [2025-03-17 04:21:47,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:21:47,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:21:47,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:21:47,102 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:21:47,102 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:21:47,103 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-17.i [2025-03-17 04:21:48,197 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cefaa438/4fa7167a3a5142209b420bdb0dce68a8/FLAGf50a2cea3 [2025-03-17 04:21:48,417 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:21:48,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-17.i [2025-03-17 04:21:48,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cefaa438/4fa7167a3a5142209b420bdb0dce68a8/FLAGf50a2cea3 [2025-03-17 04:21:48,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cefaa438/4fa7167a3a5142209b420bdb0dce68a8 [2025-03-17 04:21:48,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:21:48,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:21:48,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:48,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:21:48,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:21:48,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214c4c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48, skipping insertion in model container [2025-03-17 04:21:48,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:21:48,556 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-17.i[915,928] [2025-03-17 04:21:48,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:48,601 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:21:48,609 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-17.i[915,928] [2025-03-17 04:21:48,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:48,642 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:21:48,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48 WrapperNode [2025-03-17 04:21:48,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:48,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:48,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:21:48,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:21:48,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,677 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-17 04:21:48,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:48,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:21:48,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:21:48,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:21:48,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,700 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-17 04:21:48,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:21:48,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:21:48,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:21:48,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:21:48,714 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (1/1) ... [2025-03-17 04:21:48,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:48,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:21:48,748 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-17 04:21:48,752 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-17 04:21:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:21:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:21:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:21:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:21:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:21:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:21:48,822 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:21:48,824 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:21:49,055 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:21:49,055 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:21:49,066 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:21:49,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:21:49,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:49 BoogieIcfgContainer [2025-03-17 04:21:49,066 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:21:49,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:21:49,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:21:49,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:21:49,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:21:48" (1/3) ... [2025-03-17 04:21:49,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488cb0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:21:49, skipping insertion in model container [2025-03-17 04:21:49,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:48" (2/3) ... [2025-03-17 04:21:49,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488cb0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:21:49, skipping insertion in model container [2025-03-17 04:21:49,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:49" (3/3) ... [2025-03-17 04:21:49,077 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-17.i [2025-03-17 04:21:49,088 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:21:49,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-17.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:21:49,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:21:49,140 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;@2acca2f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:21:49,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:21:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 04:21:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 04:21:49,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:49,152 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:49,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:49,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1806824187, now seen corresponding path program 1 times [2025-03-17 04:21:49,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:21:49,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772814539] [2025-03-17 04:21:49,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:49,165 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-17 04:21:49,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:21:49,169 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-17 04:21:49,170 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-17 04:21:49,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 04:21:49,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 04:21:49,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:49,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:49,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:21:49,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:21:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-17 04:21:49,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:21:49,359 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:21:49,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772814539] [2025-03-17 04:21:49,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772814539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:21:49,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:21:49,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:21:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920232678] [2025-03-17 04:21:49,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:21:49,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:21:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:21:49,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:21:49,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:21:49,378 INFO L87 Difference]: Start difference. First operand has 38 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 04:21:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:21:49,393 INFO L93 Difference]: Finished difference Result 73 states and 126 transitions. [2025-03-17 04:21:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:21:49,394 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 83 [2025-03-17 04:21:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:21:49,398 INFO L225 Difference]: With dead ends: 73 [2025-03-17 04:21:49,398 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 04:21:49,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:21:49,403 INFO L435 NwaCegarLoop]: 53 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, 53 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-17 04:21:49,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:21:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 04:21:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-17 04:21:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 04:21:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2025-03-17 04:21:49,438 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 83 [2025-03-17 04:21:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:21:49,438 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2025-03-17 04:21:49,439 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 04:21:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2025-03-17 04:21:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 04:21:49,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:49,443 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:49,450 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-17 04:21:49,643 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-17 04:21:49,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:49,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 323679491, now seen corresponding path program 1 times [2025-03-17 04:21:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:21:49,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842463586] [2025-03-17 04:21:49,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:49,645 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-17 04:21:49,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:21:49,647 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-17 04:21:49,648 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-17 04:21:49,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 04:21:49,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 04:21:49,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:49,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:49,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 04:21:49,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:21:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 04:21:50,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:21:50,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:21:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842463586] [2025-03-17 04:21:50,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842463586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:21:50,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:21:50,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 04:21:50,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170453417] [2025-03-17 04:21:50,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:21:50,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:21:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:21:50,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:21:50,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:21:50,506 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:21:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:21:51,853 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2025-03-17 04:21:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 04:21:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 83 [2025-03-17 04:21:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:21:51,862 INFO L225 Difference]: With dead ends: 48 [2025-03-17 04:21:51,862 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 04:21:51,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:21:51,863 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:21:51,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 107 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:21:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 04:21:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-17 04:21:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 04:21:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-17 04:21:51,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 83 [2025-03-17 04:21:51,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:21:51,870 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-17 04:21:51,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:21:51,871 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-17 04:21:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 04:21:51,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:51,872 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:51,879 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 (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:21:52,074 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-17 04:21:52,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:52,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1445233852, now seen corresponding path program 1 times [2025-03-17 04:21:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:21:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146692177] [2025-03-17 04:21:52,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:52,075 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-17 04:21:52,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:21:52,080 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-17 04:21:52,081 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-17 04:21:52,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 04:21:52,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 04:21:52,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:52,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:52,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:21:52,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:21:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:21:52,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:21:52,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:21:52,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146692177] [2025-03-17 04:21:52,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146692177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:21:52,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:21:52,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:21:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841021362] [2025-03-17 04:21:52,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:21:52,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:21:52,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:21:52,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:21:52,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:21:52,526 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:21:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:21:53,122 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2025-03-17 04:21:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:21:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 84 [2025-03-17 04:21:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:21:53,130 INFO L225 Difference]: With dead ends: 50 [2025-03-17 04:21:53,130 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 04:21:53,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:21:53,131 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:21:53,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:21:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 04:21:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2025-03-17 04:21:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 04:21:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-17 04:21:53,136 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 84 [2025-03-17 04:21:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:21:53,137 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-17 04:21:53,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:21:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-17 04:21:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 04:21:53,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:53,140 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:53,146 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 (4)] Forceful destruction successful, exit code 0 [2025-03-17 04:21:53,340 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-17 04:21:53,341 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:53,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1851744260, now seen corresponding path program 1 times [2025-03-17 04:21:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:21:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7616385] [2025-03-17 04:21:53,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:53,342 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-17 04:21:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:21:53,344 INFO L229 MonitoredProcess]: Starting monitored process 5 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-17 04:21:53,345 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 (5)] Waiting until timeout for monitored process [2025-03-17 04:21:53,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 04:21:53,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 04:21:53,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:53,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:53,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 04:21:53,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:21:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 04:21:54,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:21:54,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:21:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7616385] [2025-03-17 04:21:54,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7616385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:21:54,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:21:54,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:21:54,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505373329] [2025-03-17 04:21:54,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:21:54,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:21:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:21:54,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:21:54,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:21:54,681 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:21:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:21:56,515 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2025-03-17 04:21:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 04:21:56,522 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 85 [2025-03-17 04:21:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:21:56,523 INFO L225 Difference]: With dead ends: 50 [2025-03-17 04:21:56,523 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:21:56,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-17 04:21:56,524 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:21:56,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 112 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 04:21:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:21:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:21:56,525 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-17 04:21:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:21:56,525 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2025-03-17 04:21:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:21:56,525 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:21:56,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:21:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:21:56,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:21:56,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:21:56,535 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 (5)] Forceful destruction successful, exit code 0 [2025-03-17 04:21:56,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-17 04:21:56,731 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 04:21:56,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:21:57,267 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:21:57,274 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 04:21:57,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 04:21:57,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 04:21:57,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 04:21:57,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 04:21:57,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 04:21:57,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:21:57 BoogieIcfgContainer [2025-03-17 04:21:57,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:21:57,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:21:57,276 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:21:57,277 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:21:57,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:49" (3/4) ... [2025-03-17 04:21:57,278 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:21:57,282 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:21:57,284 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 04:21:57,284 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 04:21:57,284 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:21:57,284 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:21:57,339 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:21:57,340 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:21:57,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:21:57,342 INFO L158 Benchmark]: Toolchain (without parser) took 8897.95ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 65.1MB in the end (delta: 27.7MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2025-03-17 04:21:57,343 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 62.7MB in the beginning and 62.7MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:57,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.78ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 80.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:57,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.03ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:57,344 INFO L158 Benchmark]: Boogie Preprocessor took 33.88ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:57,344 INFO L158 Benchmark]: IcfgBuilder took 353.00ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 64.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:57,344 INFO L158 Benchmark]: TraceAbstraction took 8207.00ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 71.2MB in the end (delta: -7.4MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2025-03-17 04:21:57,344 INFO L158 Benchmark]: Witness Printer took 63.54ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 65.1MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:57,345 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.15ms. Allocated memory is still 83.9MB. Free memory was 62.7MB in the beginning and 62.7MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.78ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 80.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.03ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.88ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 353.00ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 64.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8207.00ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 71.2MB in the end (delta: -7.4MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * Witness Printer took 63.54ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 65.1MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. 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, 38 locations, 71 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 438 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 266 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 172 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=2, InterpolantAutomatonStates: 31, 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, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 928 SizeOfPredicates, 20 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1456/1456 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-17 04:21:57,366 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