./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-26.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 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:15:07,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:15:07,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:15:07,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:15:07,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:15:07,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:15:07,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:15:07,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:15:07,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:15:07,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:15:07,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:15:07,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:15:07,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:15:07,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:15:07,142 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:15:07,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:15:07,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:15:07,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:15:07,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:15:07,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:15:07,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:15:07,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:15:07,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:15:07,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:15:07,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:15:07,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:15:07,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:15:07,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:15:07,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:15:07,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:15:07,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:15:07,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:15:07,146 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 -> 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 [2025-03-08 15:15:07,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:15:07,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:15:07,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:15:07,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:15:07,404 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:15:07,405 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-26.i [2025-03-08 15:15:08,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5522aaf/bc9f7d9b7db646b6b34c50b72dc8a100/FLAG6238b0776 [2025-03-08 15:15:08,770 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:15:08,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2025-03-08 15:15:08,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5522aaf/bc9f7d9b7db646b6b34c50b72dc8a100/FLAG6238b0776 [2025-03-08 15:15:09,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5522aaf/bc9f7d9b7db646b6b34c50b72dc8a100 [2025-03-08 15:15:09,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:15:09,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:15:09,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:15:09,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:15:09,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:15:09,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3426a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09, skipping insertion in model container [2025-03-08 15:15:09,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:15:09,237 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-26.i[915,928] [2025-03-08 15:15:09,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:15:09,278 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:15:09,287 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-26.i[915,928] [2025-03-08 15:15:09,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:15:09,312 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:15:09,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09 WrapperNode [2025-03-08 15:15:09,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:15:09,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:15:09,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:15:09,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:15:09,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,334 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2025-03-08 15:15:09,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:15:09,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:15:09,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:15:09,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:15:09,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,353 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-08 15:15:09,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:15:09,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:15:09,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:15:09,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:15:09,361 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (1/1) ... [2025-03-08 15:15:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:15:09,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:15:09,384 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-08 15:15:09,386 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-08 15:15:09,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:15:09,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:15:09,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:15:09,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:15:09,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:15:09,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:15:09,445 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:15:09,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:15:09,585 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:15:09,585 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:15:09,592 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:15:09,593 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:15:09,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:09 BoogieIcfgContainer [2025-03-08 15:15:09,593 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:15:09,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:15:09,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:15:09,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:15:09,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:15:09" (1/3) ... [2025-03-08 15:15:09,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b15183e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:15:09, skipping insertion in model container [2025-03-08 15:15:09,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:09" (2/3) ... [2025-03-08 15:15:09,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b15183e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:15:09, skipping insertion in model container [2025-03-08 15:15:09,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:09" (3/3) ... [2025-03-08 15:15:09,601 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-26.i [2025-03-08 15:15:09,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:15:09,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-26.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:15:09,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:15:09,653 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;@ec1ad92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:15:09,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:15:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 15:15:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 15:15:09,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:15:09,662 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:15:09,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:15:09,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:15:09,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1138182487, now seen corresponding path program 1 times [2025-03-08 15:15:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:15:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068124497] [2025-03-08 15:15:09,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:09,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:15:09,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 15:15:09,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 15:15:09,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:09,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:15:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 15:15:09,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:15:09,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068124497] [2025-03-08 15:15:09,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068124497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:15:09,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323607122] [2025-03-08 15:15:09,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:09,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:15:09,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:15:09,866 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-08 15:15:09,868 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-08 15:15:09,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 15:15:09,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 15:15:09,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:09,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:15:09,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:15:09,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:15:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 15:15:09,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:15:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323607122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:15:09,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:15:09,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:15:09,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845766651] [2025-03-08 15:15:09,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:15:09,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:15:09,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:15:10,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:15:10,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:15:10,005 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:15:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:15:10,020 INFO L93 Difference]: Finished difference Result 80 states and 130 transitions. [2025-03-08 15:15:10,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:15:10,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-03-08 15:15:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:15:10,025 INFO L225 Difference]: With dead ends: 80 [2025-03-08 15:15:10,025 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 15:15:10,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-08 15:15:10,030 INFO L435 NwaCegarLoop]: 55 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, 55 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-08 15:15:10,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:15:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 15:15:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 15:15:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 15:15:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-03-08 15:15:10,055 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 94 [2025-03-08 15:15:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:15:10,056 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-03-08 15:15:10,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:15:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-03-08 15:15:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 15:15:10,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:15:10,059 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:15:10,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:15:10,259 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-08 15:15:10,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:15:10,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:15:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash -695325128, now seen corresponding path program 1 times [2025-03-08 15:15:10,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:15:10,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576183473] [2025-03-08 15:15:10,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:10,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:15:10,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 15:15:10,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 15:15:10,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:10,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:15:10,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:15:10,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 15:15:10,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 15:15:10,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:10,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:15:10,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:15:10,472 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:15:10,472 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:15:10,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:15:10,475 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 15:15:10,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:15:10,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:15:10 BoogieIcfgContainer [2025-03-08 15:15:10,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:15:10,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:15:10,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:15:10,523 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:15:10,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:09" (3/4) ... [2025-03-08 15:15:10,525 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:15:10,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:15:10,526 INFO L158 Benchmark]: Toolchain (without parser) took 1402.82ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 35.4MB in the end (delta: 88.4MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-08 15:15:10,527 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:15:10,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.15ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 111.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:15:10,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.18ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 109.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:15:10,528 INFO L158 Benchmark]: Boogie Preprocessor took 23.22ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 109.0MB in the end (delta: 952.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:15:10,528 INFO L158 Benchmark]: IcfgBuilder took 232.74ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 94.8MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:15:10,529 INFO L158 Benchmark]: TraceAbstraction took 926.37ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 35.4MB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 15:15:10,529 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 167.8MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:15:10,541 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.28ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.15ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 111.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.18ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 109.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.22ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 109.0MB in the end (delta: 952.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 232.74ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 94.8MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 926.37ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 35.4MB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 167.8MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] unsigned long int var_1_3 = 4; [L25] unsigned long int var_1_4 = 64; [L26] unsigned long int var_1_5 = 32; [L27] unsigned long int var_1_6 = 1908995780; [L28] unsigned long int var_1_7 = 0; [L29] double var_1_8 = 1.7; [L30] double var_1_9 = 1.7; [L31] signed short int var_1_10 = -32; [L32] signed short int var_1_11 = -16; VAL [isInitial=0, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L76] isInitial = 1 [L77] FCALL initially() [L78] COND TRUE 1 [L79] FCALL updateLastVariables() [L80] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L48] var_1_3 = __VERIFIER_nondet_ulong() [L49] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L49] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L50] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L50] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L51] var_1_4 = __VERIFIER_nondet_ulong() [L52] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L52] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L53] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L53] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L54] var_1_5 = __VERIFIER_nondet_ulong() [L55] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L55] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L57] var_1_6 = __VERIFIER_nondet_ulong() [L58] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L58] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L60] var_1_7 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_8=17/10, var_1_9=17/10] [L61] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_8=17/10, var_1_9=17/10] [L62] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10, var_1_9=17/10] [L62] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10, var_1_9=17/10] [L63] var_1_9 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L64] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L65] var_1_11 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_11 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L66] RET assume_abort_if_not(var_1_11 >= -32767) VAL [isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L67] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L67] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L80] RET updateVariables() [L81] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) VAL [isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=1073741825, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=17/10] [L41] var_1_8 = var_1_9 [L42] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=1073741825, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=2147483652, var_1_9=2147483652] [L81] RET step() [L82] CALL, EXPR property() [L72-L73] return ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))))) : (var_1_1 == ((unsigned long int) (3164264966u - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7)))))))) && (var_1_8 == ((double) var_1_9))) && (var_1_10 == ((signed short int) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=1073741825, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=2147483652, var_1_9=2147483652] [L82] RET, EXPR property() [L82] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=1073741825, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=2147483652, var_1_9=2147483652] [L19] reach_error() VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=1073741825, var_1_2=1, var_1_3=1073741825, var_1_4=0, var_1_5=1073741824, var_1_6=2147483647, var_1_7=1073741823, var_1_8=2147483652, var_1_9=2147483652] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 75 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 15, 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, 55 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, 55 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 214 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 812/840 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-08 15:15:10,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-26.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 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:15:12,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:15:12,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:15:12,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:15:12,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:15:12,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:15:12,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:15:12,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:15:12,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:15:12,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:15:12,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:15:12,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:15:12,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:15:12,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:15:12,468 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:15:12,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:15:12,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:15:12,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:15:12,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:15:12,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:15:12,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:15:12,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:15:12,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:15:12,469 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:15:12,469 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:15:12,469 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:15:12,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:15:12,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:15:12,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:15:12,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:15:12,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:15:12,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:15:12,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:15:12,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:15:12,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:15:12,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:15:12,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:15:12,470 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:15:12,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:15:12,471 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:15:12,471 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:15:12,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:15:12,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:15:12,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:15:12,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:15:12,471 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 -> 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 [2025-03-08 15:15:12,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:15:12,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:15:12,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:15:12,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:15:12,701 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:15:12,703 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-26.i [2025-03-08 15:15:13,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d3cc3dd/7e719d5011764fcf871a0d2e1ab3a381/FLAG84eca5be3 [2025-03-08 15:15:14,077 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:15:14,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2025-03-08 15:15:14,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d3cc3dd/7e719d5011764fcf871a0d2e1ab3a381/FLAG84eca5be3 [2025-03-08 15:15:14,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d3cc3dd/7e719d5011764fcf871a0d2e1ab3a381 [2025-03-08 15:15:14,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:15:14,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:15:14,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:15:14,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:15:14,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:15:14,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b439e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14, skipping insertion in model container [2025-03-08 15:15:14,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:15:14,230 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-26.i[915,928] [2025-03-08 15:15:14,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:15:14,265 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:15:14,273 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-26.i[915,928] [2025-03-08 15:15:14,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:15:14,308 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:15:14,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14 WrapperNode [2025-03-08 15:15:14,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:15:14,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:15:14,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:15:14,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:15:14,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,335 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-03-08 15:15:14,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:15:14,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:15:14,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:15:14,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:15:14,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,351 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-08 15:15:14,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:15:14,364 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:15:14,364 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:15:14,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:15:14,365 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (1/1) ... [2025-03-08 15:15:14,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:15:14,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:15:14,393 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-08 15:15:14,396 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-08 15:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:15:14,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:15:14,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:15:14,472 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:15:14,474 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:15:14,650 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:15:14,652 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:15:14,659 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:15:14,659 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:15:14,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:14 BoogieIcfgContainer [2025-03-08 15:15:14,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:15:14,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:15:14,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:15:14,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:15:14,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:15:14" (1/3) ... [2025-03-08 15:15:14,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264f3df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:15:14, skipping insertion in model container [2025-03-08 15:15:14,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:14" (2/3) ... [2025-03-08 15:15:14,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264f3df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:15:14, skipping insertion in model container [2025-03-08 15:15:14,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:14" (3/3) ... [2025-03-08 15:15:14,669 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-26.i [2025-03-08 15:15:14,681 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:15:14,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-26.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:15:14,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:15:14,737 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;@5008b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:15:14,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:15:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 15:15:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 15:15:14,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:15:14,749 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:15:14,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:15:14,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:15:14,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1138182487, now seen corresponding path program 1 times [2025-03-08 15:15:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:15:14,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830406120] [2025-03-08 15:15:14,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:14,765 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-08 15:15:14,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:15:14,769 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-08 15:15:14,770 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-08 15:15:14,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 15:15:14,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 15:15:14,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:14,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:15:14,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:15:14,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:15:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-08 15:15:14,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:15:14,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:15:14,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830406120] [2025-03-08 15:15:14,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830406120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:15:14,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:15:14,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:15:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938184324] [2025-03-08 15:15:14,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:15:14,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:15:14,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:15:14,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:15:14,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:15:14,985 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:15:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:15:15,004 INFO L93 Difference]: Finished difference Result 80 states and 130 transitions. [2025-03-08 15:15:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:15:15,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-03-08 15:15:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:15:15,011 INFO L225 Difference]: With dead ends: 80 [2025-03-08 15:15:15,011 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 15:15:15,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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-08 15:15:15,017 INFO L435 NwaCegarLoop]: 55 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, 55 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-08 15:15:15,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:15:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 15:15:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 15:15:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 15:15:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-03-08 15:15:15,050 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 94 [2025-03-08 15:15:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:15:15,051 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-03-08 15:15:15,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 15:15:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-03-08 15:15:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 15:15:15,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:15:15,053 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:15:15,059 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-08 15:15:15,254 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-08 15:15:15,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:15:15,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:15:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash -695325128, now seen corresponding path program 1 times [2025-03-08 15:15:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:15:15,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191842898] [2025-03-08 15:15:15,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:15,256 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-08 15:15:15,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:15:15,258 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-08 15:15:15,259 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-08 15:15:15,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 15:15:15,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 15:15:15,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:15,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:15:15,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 15:15:15,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:15:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 104 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-08 15:15:17,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:15:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 15:15:19,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:15:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191842898] [2025-03-08 15:15:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191842898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:15:19,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:15:19,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-08 15:15:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128629754] [2025-03-08 15:15:19,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:15:19,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 15:15:19,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:15:19,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 15:15:19,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:15:19,196 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-08 15:15:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:15:20,641 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-03-08 15:15:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:15:20,643 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 94 [2025-03-08 15:15:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:15:20,644 INFO L225 Difference]: With dead ends: 55 [2025-03-08 15:15:20,644 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 15:15:20,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2025-03-08 15:15:20,645 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:15:20,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 205 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:15:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 15:15:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2025-03-08 15:15:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 15:15:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2025-03-08 15:15:20,660 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 94 [2025-03-08 15:15:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:15:20,661 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-03-08 15:15:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-08 15:15:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2025-03-08 15:15:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 15:15:20,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:15:20,664 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:15:20,668 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-08 15:15:20,864 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-08 15:15:20,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:15:20,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:15:20,865 INFO L85 PathProgramCache]: Analyzing trace with hash -666695977, now seen corresponding path program 1 times [2025-03-08 15:15:20,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:15:20,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847898881] [2025-03-08 15:15:20,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:20,865 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-08 15:15:20,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:15:20,867 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-08 15:15:20,869 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-08 15:15:20,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 15:15:20,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 15:15:20,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:20,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:15:20,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 15:15:20,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:15:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 104 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-08 15:15:22,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:15:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 15:15:22,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:15:22,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847898881] [2025-03-08 15:15:22,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847898881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:15:22,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:15:22,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-08 15:15:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274930424] [2025-03-08 15:15:22,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:15:22,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 15:15:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:15:22,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 15:15:22,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:15:22,680 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-08 15:15:23,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:15:23,530 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-03-08 15:15:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:15:23,532 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 94 [2025-03-08 15:15:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:15:23,533 INFO L225 Difference]: With dead ends: 53 [2025-03-08 15:15:23,533 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 15:15:23,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2025-03-08 15:15:23,534 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 55 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:15:23,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 192 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:15:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 15:15:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 15:15:23,536 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-08 15:15:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 15:15:23,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2025-03-08 15:15:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:15:23,536 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 15:15:23,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-08 15:15:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 15:15:23,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 15:15:23,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:15:23,542 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-08 15:15:23,739 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-08 15:15:23,741 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 15:15:23,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 15:15:24,175 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:15:24,181 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 15:15:24,182 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 15:15:24,182 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 15:15:24,182 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 15:15:24,182 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-08 15:15:24,182 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 15:15:24,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:15:24 BoogieIcfgContainer [2025-03-08 15:15:24,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:15:24,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:15:24,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:15:24,183 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:15:24,184 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:14" (3/4) ... [2025-03-08 15:15:24,185 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 15:15:24,188 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 15:15:24,191 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 15:15:24,191 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 15:15:24,191 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 15:15:24,191 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 15:15:24,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 15:15:24,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 15:15:24,246 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:15:24,246 INFO L158 Benchmark]: Toolchain (without parser) took 10141.74ms. Allocated memory was 83.9MB in the beginning and 226.5MB in the end (delta: 142.6MB). Free memory was 59.1MB in the beginning and 113.4MB in the end (delta: -54.3MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2025-03-08 15:15:24,246 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.1MB in the end (delta: 35.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:15:24,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.71ms. Allocated memory is still 83.9MB. Free memory was 58.8MB in the beginning and 46.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:15:24,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.51ms. Allocated memory is still 83.9MB. Free memory was 46.7MB in the beginning and 45.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:15:24,247 INFO L158 Benchmark]: Boogie Preprocessor took 27.89ms. Allocated memory is still 83.9MB. Free memory was 45.2MB in the beginning and 43.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:15:24,247 INFO L158 Benchmark]: IcfgBuilder took 294.95ms. Allocated memory is still 83.9MB. Free memory was 43.3MB in the beginning and 30.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:15:24,247 INFO L158 Benchmark]: TraceAbstraction took 9519.98ms. Allocated memory was 83.9MB in the beginning and 226.5MB in the end (delta: 142.6MB). Free memory was 29.7MB in the beginning and 119.2MB in the end (delta: -89.5MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2025-03-08 15:15:24,248 INFO L158 Benchmark]: Witness Printer took 62.76ms. Allocated memory is still 226.5MB. Free memory was 119.2MB in the beginning and 113.4MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:15:24,249 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.28ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.1MB in the end (delta: 35.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.71ms. Allocated memory is still 83.9MB. Free memory was 58.8MB in the beginning and 46.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.51ms. Allocated memory is still 83.9MB. Free memory was 46.7MB in the beginning and 45.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.89ms. Allocated memory is still 83.9MB. Free memory was 45.2MB in the beginning and 43.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 294.95ms. Allocated memory is still 83.9MB. Free memory was 43.3MB in the beginning and 30.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9519.98ms. Allocated memory was 83.9MB in the beginning and 226.5MB in the end (delta: 142.6MB). Free memory was 29.7MB in the beginning and 119.2MB in the end (delta: -89.5MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * Witness Printer took 62.76ms. Allocated memory is still 226.5MB. Free memory was 119.2MB in the beginning and 113.4MB in the end (delta: 5.8MB). 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, 43 locations, 75 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 452 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 324 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 465 IncrementalHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 128 mSDtfsCounter, 465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=2, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 465 ConstructedInterpolants, 2 QuantifiedInterpolants, 2756 SizeOfPredicates, 38 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1880/2100 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-08 15:15:24,269 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