./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.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 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:05:41,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:05:41,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:05:41,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:05:41,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:05:41,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:05:41,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:05:41,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:05:41,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:05:41,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:05:41,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:05:41,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:05:41,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:05:41,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:05:41,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:05:41,553 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:05:41,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:05:41,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:05:41,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:05:41,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:05:41,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:41,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:05:41,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:05:41,559 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:05:41,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:05:41,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:05:41,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:05:41,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:05:41,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:05:41,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:05:41,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:05:41,559 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 -> 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 [2025-03-04 00:05:41,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:05:41,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:05:41,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:05:41,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:05:41,910 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:05:41,911 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-72.i [2025-03-04 00:05:43,565 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599f71305/c914881b8f554ae7bc0fa8a83ecdc4af/FLAGf2fd91d8c [2025-03-04 00:05:43,955 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:05:43,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2025-03-04 00:05:43,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599f71305/c914881b8f554ae7bc0fa8a83ecdc4af/FLAGf2fd91d8c [2025-03-04 00:05:43,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599f71305/c914881b8f554ae7bc0fa8a83ecdc4af [2025-03-04 00:05:43,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:05:44,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:05:44,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:44,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:05:44,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:05:44,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:43" (1/1) ... [2025-03-04 00:05:44,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44, skipping insertion in model container [2025-03-04 00:05:44,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:43" (1/1) ... [2025-03-04 00:05:44,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:05:44,212 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-72.i[915,928] [2025-03-04 00:05:44,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:44,266 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:05:44,284 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-72.i[915,928] [2025-03-04 00:05:44,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:44,311 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:05:44,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44 WrapperNode [2025-03-04 00:05:44,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:44,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:44,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:05:44,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:05:44,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,342 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2025-03-04 00:05:44,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:44,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:05:44,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:05:44,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:05:44,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,377 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:05:44,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:05:44,400 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:05:44,400 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:05:44,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:05:44,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (1/1) ... [2025-03-04 00:05:44,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:44,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:44,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:05:44,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:05:44,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:05:44,507 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:05:44,507 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:05:44,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:05:44,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:05:44,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:05:44,593 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:05:44,595 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:05:44,844 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:05:44,846 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:05:44,854 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:05:44,854 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:05:44,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:44 BoogieIcfgContainer [2025-03-04 00:05:44,855 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:05:44,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:05:44,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:05:44,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:05:44,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:05:43" (1/3) ... [2025-03-04 00:05:44,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d53443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:44, skipping insertion in model container [2025-03-04 00:05:44,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:44" (2/3) ... [2025-03-04 00:05:44,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d53443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:44, skipping insertion in model container [2025-03-04 00:05:44,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:44" (3/3) ... [2025-03-04 00:05:44,864 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-72.i [2025-03-04 00:05:44,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:05:44,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-72.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:05:44,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:05:44,946 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;@536538f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:05:44,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:05:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 00:05:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 00:05:44,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:44,959 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:44,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:44,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1794803693, now seen corresponding path program 1 times [2025-03-04 00:05:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:05:44,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666265584] [2025-03-04 00:05:44,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:44,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:05:45,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:05:45,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:05:45,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:45,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 00:05:45,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:05:45,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666265584] [2025-03-04 00:05:45,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666265584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:05:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722015464] [2025-03-04 00:05:45,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:45,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:05:45,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:45,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:05:45,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:05:45,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:05:45,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:05:45,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:45,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:45,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:05:45,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 00:05:45,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:45,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722015464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:45,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:05:45,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:05:45,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214409062] [2025-03-04 00:05:45,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:45,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:05:45,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:05:45,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:05:45,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:45,508 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 00:05:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:45,536 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2025-03-04 00:05:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:05:45,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2025-03-04 00:05:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:45,550 INFO L225 Difference]: With dead ends: 72 [2025-03-04 00:05:45,550 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 00:05:45,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:45,563 INFO L435 NwaCegarLoop]: 49 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, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:45,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:05:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 00:05:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 00:05:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 00:05:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-04 00:05:45,605 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 82 [2025-03-04 00:05:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:45,609 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-04 00:05:45,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 00:05:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-04 00:05:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 00:05:45,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:45,612 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:45,624 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-04 00:05:45,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:05:45,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:45,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash 892734190, now seen corresponding path program 1 times [2025-03-04 00:05:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:05:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924783944] [2025-03-04 00:05:45,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:05:45,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:05:45,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:05:45,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:45,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:05:45,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:05:45,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:05:46,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:05:46,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:46,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:05:46,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:05:46,177 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:05:46,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:05:46,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:05:46,182 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:05:46,259 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:05:46,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:05:46 BoogieIcfgContainer [2025-03-04 00:05:46,265 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:05:46,266 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:05:46,266 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:05:46,266 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:05:46,267 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:44" (3/4) ... [2025-03-04 00:05:46,269 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:05:46,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:05:46,275 INFO L158 Benchmark]: Toolchain (without parser) took 2267.57ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 51.6MB in the end (delta: 83.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-04 00:05:46,276 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:46,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.97ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 123.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:46,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.06ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:46,280 INFO L158 Benchmark]: Boogie Preprocessor took 55.06ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 120.5MB in the end (delta: 961.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:46,280 INFO L158 Benchmark]: IcfgBuilder took 454.97ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 107.1MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:46,280 INFO L158 Benchmark]: TraceAbstraction took 1408.30ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 51.6MB in the end (delta: 55.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 00:05:46,280 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 167.8MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:46,284 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.16ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.97ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 123.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.06ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.06ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 120.5MB in the end (delta: 961.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 454.97ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 107.1MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1408.30ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 51.6MB in the end (delta: 55.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 167.8MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 25.3kB). 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 someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 4; [L23] unsigned long int var_1_3 = 3854620897; [L24] unsigned long int var_1_4 = 1; [L25] unsigned long int var_1_5 = 5; [L26] unsigned long int var_1_6 = 1934698459; [L27] unsigned long int var_1_7 = 1000000000; [L28] unsigned long int var_1_8 = 0; [L29] unsigned long int var_1_9 = 16; [L30] double var_1_10 = 31.375; [L31] double var_1_11 = -0.6; VAL [isInitial=0, var_1_10=251/8, var_1_1=4, var_1_3=3854620897, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L71] isInitial = 1 [L72] FCALL initially() [L73] COND TRUE 1 [L74] FCALL updateLastVariables() [L75] CALL updateVariables() [L43] var_1_3 = __VERIFIER_nondet_ulong() [L44] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L44] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L45] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L45] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L46] var_1_4 = __VERIFIER_nondet_ulong() [L47] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L47] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L48] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L48] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L49] var_1_5 = __VERIFIER_nondet_ulong() [L50] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L50] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L51] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L51] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L52] var_1_6 = __VERIFIER_nondet_ulong() [L53] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L53] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L54] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L54] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L55] var_1_7 = __VERIFIER_nondet_ulong() [L56] CALL assume_abort_if_not(var_1_7 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=0, var_1_9=16] [L56] RET assume_abort_if_not(var_1_7 >= 536870911) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=0, var_1_9=16] [L57] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=0, var_1_9=16] [L57] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=0, var_1_9=16] [L58] var_1_8 = __VERIFIER_nondet_ulong() [L59] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_9=16] [L59] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_9=16] [L60] CALL assume_abort_if_not(var_1_8 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=16] [L60] RET assume_abort_if_not(var_1_8 <= 536870911) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=16] [L61] var_1_11 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=16] [L62] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=16] [L75] RET updateVariables() [L76] CALL step() [L35] var_1_9 = var_1_7 [L36] var_1_10 = var_1_11 [L37] unsigned long int stepLocal_0 = var_1_9; VAL [isInitial=1, stepLocal_0=-3758096385, var_1_10=4294967299, var_1_11=4294967299, var_1_1=4, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=-3758096385] [L38] COND TRUE stepLocal_0 >= (var_1_3 - ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) [L39] var_1_1 = (var_1_4 + (var_1_6 - (var_1_7 - var_1_8))) VAL [isInitial=1, var_1_10=4294967299, var_1_11=4294967299, var_1_1=4294967294, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=-3758096385] [L76] RET step() [L77] CALL, EXPR property() [L67-L68] return (((var_1_9 >= (var_1_3 - ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((unsigned long int) (var_1_4 + (var_1_6 - (var_1_7 - var_1_8))))) : 1) && (var_1_9 == ((unsigned long int) var_1_7))) && (var_1_10 == ((double) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=4294967299, var_1_11=4294967299, var_1_1=4294967294, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=-3758096385] [L77] RET, EXPR property() [L77] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=4294967299, var_1_11=4294967299, var_1_1=4294967294, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=-3758096385] [L19] reach_error() VAL [isInitial=1, var_1_10=4294967299, var_1_11=4294967299, var_1_1=4294967294, var_1_3=-9223372029875453954, var_1_4=2147483647, var_1_5=2147483647, var_1_6=-2147483649, var_1_7=-3758096385, var_1_8=536870911, var_1_9=-3758096385] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 49 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, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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.2s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 191 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 600/624 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:05:46,318 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-72.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 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:05:49,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:05:49,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:05:49,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:05:49,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:05:49,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:05:49,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:05:49,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:05:49,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:05:49,617 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:05:49,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:05:49,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:05:49,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:05:49,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:05:49,620 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:05:49,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:49,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:05:49,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:05:49,621 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 -> 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 [2025-03-04 00:05:50,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:05:50,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:05:50,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:05:50,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:05:50,062 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:05:50,063 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-72.i [2025-03-04 00:05:51,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce513ff4/e4a303067044417b84bb9c46f27ddb31/FLAGbc836f593 [2025-03-04 00:05:51,993 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:05:51,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2025-03-04 00:05:52,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce513ff4/e4a303067044417b84bb9c46f27ddb31/FLAGbc836f593 [2025-03-04 00:05:52,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce513ff4/e4a303067044417b84bb9c46f27ddb31 [2025-03-04 00:05:52,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:05:52,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:05:52,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:52,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:05:52,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:05:52,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b778f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52, skipping insertion in model container [2025-03-04 00:05:52,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:05:52,188 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-72.i[915,928] [2025-03-04 00:05:52,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:52,250 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:05:52,260 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-72.i[915,928] [2025-03-04 00:05:52,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:52,306 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:05:52,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52 WrapperNode [2025-03-04 00:05:52,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:52,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:52,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:05:52,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:05:52,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,358 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2025-03-04 00:05:52,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:52,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:05:52,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:05:52,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:05:52,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,374 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:05:52,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:05:52,391 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:05:52,391 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:05:52,391 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:05:52,392 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (1/1) ... [2025-03-04 00:05:52,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:52,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:52,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:05:52,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:05:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:05:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:05:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:05:52,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:05:52,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:05:52,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:05:52,513 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:05:52,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:05:52,752 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:05:52,752 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:05:52,758 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:05:52,759 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:05:52,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:52 BoogieIcfgContainer [2025-03-04 00:05:52,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:05:52,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:05:52,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:05:52,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:05:52,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:05:52" (1/3) ... [2025-03-04 00:05:52,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e7ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:52, skipping insertion in model container [2025-03-04 00:05:52,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:52" (2/3) ... [2025-03-04 00:05:52,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e7ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:52, skipping insertion in model container [2025-03-04 00:05:52,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:52" (3/3) ... [2025-03-04 00:05:52,774 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-72.i [2025-03-04 00:05:52,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:05:52,790 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-72.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:05:52,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:05:52,857 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;@3e8c96a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:05:52,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:05:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 00:05:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 00:05:52,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:52,877 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:52,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:52,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1794803693, now seen corresponding path program 1 times [2025-03-04 00:05:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:52,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333362082] [2025-03-04 00:05:52,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:52,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:52,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:52,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:05:52,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:05:53,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:05:53,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:05:53,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:53,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:53,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:05:53,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 00:05:53,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:53,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:53,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333362082] [2025-03-04 00:05:53,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333362082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:53,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:53,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:05:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245204016] [2025-03-04 00:05:53,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:53,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:05:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:53,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:05:53,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:53,155 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 00:05:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:53,168 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2025-03-04 00:05:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:05:53,170 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2025-03-04 00:05:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:53,173 INFO L225 Difference]: With dead ends: 72 [2025-03-04 00:05:53,174 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 00:05:53,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:53,177 INFO L435 NwaCegarLoop]: 49 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, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:53,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:05:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 00:05:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 00:05:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 00:05:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-04 00:05:53,209 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 82 [2025-03-04 00:05:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:53,210 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-04 00:05:53,210 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 00:05:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-04 00:05:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 00:05:53,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:53,213 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:53,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:05:53,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:53,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:53,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash 892734190, now seen corresponding path program 1 times [2025-03-04 00:05:53,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:53,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014418138] [2025-03-04 00:05:53,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:53,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:53,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:53,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:05:53,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:05:53,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:05:53,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:05:53,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:53,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:53,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:05:53,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-04 00:05:54,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:54,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:54,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014418138] [2025-03-04 00:05:54,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014418138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:54,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:54,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:05:54,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657602158] [2025-03-04 00:05:54,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:54,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:05:54,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:54,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:05:54,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:05:54,389 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 00:05:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:55,692 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2025-03-04 00:05:55,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 00:05:55,693 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 82 [2025-03-04 00:05:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:55,694 INFO L225 Difference]: With dead ends: 79 [2025-03-04 00:05:55,694 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 00:05:55,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:05:55,696 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 71 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:55,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 198 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:05:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 00:05:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2025-03-04 00:05:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:05:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2025-03-04 00:05:55,710 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 82 [2025-03-04 00:05:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:55,712 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-03-04 00:05:55,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 00:05:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2025-03-04 00:05:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 00:05:55,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:55,713 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:55,719 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-04 00:05:55,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:55,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:55,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:55,915 INFO L85 PathProgramCache]: Analyzing trace with hash 893657711, now seen corresponding path program 1 times [2025-03-04 00:05:55,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:55,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398632439] [2025-03-04 00:05:55,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:55,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:55,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:55,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:05:55,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:05:55,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:05:56,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:05:56,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:56,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:56,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 00:05:56,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-04 00:05:56,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:05:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-04 00:05:58,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398632439] [2025-03-04 00:05:58,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398632439] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:05:58,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:05:58,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2025-03-04 00:05:58,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960030416] [2025-03-04 00:05:58,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:58,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:05:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:58,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:05:58,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:05:58,445 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 00:06:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:01,429 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2025-03-04 00:06:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:06:01,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 82 [2025-03-04 00:06:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:01,431 INFO L225 Difference]: With dead ends: 75 [2025-03-04 00:06:01,431 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:06:01,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:06:01,432 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:01,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 152 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 00:06:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:06:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:06:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 00:06:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:06:01,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2025-03-04 00:06:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:01,433 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:06:01,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 00:06:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:06:01,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:06:01,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:06:01,440 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-04 00:06:01,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:01,639 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:06:01,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:06:07,480 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:06:07,494 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:06:07,495 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:06:07,495 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:06:07,495 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:06:07,495 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:06:07,495 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:06:07,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:06:07 BoogieIcfgContainer [2025-03-04 00:06:07,496 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:06:07,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:06:07,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:06:07,499 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:06:07,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:52" (3/4) ... [2025-03-04 00:06:07,505 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:06:07,512 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:06:07,523 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 00:06:07,524 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:06:07,524 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:06:07,524 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:06:07,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:06:07,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:06:07,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:06:07,628 INFO L158 Benchmark]: Toolchain (without parser) took 15584.99ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 90.7MB in the beginning and 189.4MB in the end (delta: -98.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2025-03-04 00:06:07,628 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:07,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.75ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 78.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:07,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.86ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 77.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:07,628 INFO L158 Benchmark]: Boogie Preprocessor took 31.79ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 75.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:07,629 INFO L158 Benchmark]: IcfgBuilder took 369.30ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 61.7MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:07,629 INFO L158 Benchmark]: TraceAbstraction took 14734.20ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 61.1MB in the beginning and 195.3MB in the end (delta: -134.2MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. [2025-03-04 00:06:07,629 INFO L158 Benchmark]: Witness Printer took 128.59ms. Allocated memory is still 226.5MB. Free memory was 195.3MB in the beginning and 189.4MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:07,635 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.19ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.75ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 78.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.86ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 77.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.79ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 75.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 369.30ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 61.7MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14734.20ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 61.1MB in the beginning and 195.3MB in the end (delta: -134.2MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. * Witness Printer took 128.59ms. Allocated memory is still 226.5MB. Free memory was 195.3MB in the beginning and 189.4MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 399 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 263 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 373 IncrementalHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 136 mSDtfsCounter, 373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 324 ConstructedInterpolants, 5 QuantifiedInterpolants, 1405 SizeOfPredicates, 29 NumberOfNonLiveVariables, 407 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1242/1248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 00:06:07,705 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 Writing output log to file Ultimate.log Result: TRUE