./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-94.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_loopvsstraightlinecode_25-1loop_file-94.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 60036eeb32f319b97447b54d2424c6e2924357980a7a83b9a9490038fdc9d6d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:23,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:23,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:15:23,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:23,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:23,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:23,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:23,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:23,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:23,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:23,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:23,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:23,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:23,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:23,255 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:23,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:23,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:23,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:23,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:23,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:23,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:23,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:23,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:23,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:23,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:23,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:23,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:23,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:15:23,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:15:23,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:23,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:23,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:23,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:23,258 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 -> 60036eeb32f319b97447b54d2424c6e2924357980a7a83b9a9490038fdc9d6d3 [2025-03-03 23:15:23,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:23,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:23,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:23,501 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:23,501 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:23,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-94.i [2025-03-03 23:15:24,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828fc8813/9aaf2e23a50648c0b9da3cd77aaab6a0/FLAG07c94b798 [2025-03-03 23:15:24,937 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:24,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-94.i [2025-03-03 23:15:24,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828fc8813/9aaf2e23a50648c0b9da3cd77aaab6a0/FLAG07c94b798 [2025-03-03 23:15:25,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828fc8813/9aaf2e23a50648c0b9da3cd77aaab6a0 [2025-03-03 23:15:25,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:15:25,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:15:25,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:25,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:15:25,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:15:25,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415ccde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25, skipping insertion in model container [2025-03-03 23:15:25,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:15:25,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-94.i[915,928] [2025-03-03 23:15:25,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:25,431 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:15:25,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-94.i[915,928] [2025-03-03 23:15:25,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:25,477 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:15:25,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25 WrapperNode [2025-03-03 23:15:25,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:25,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:25,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:15:25,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:15:25,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,520 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-03 23:15:25,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:25,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:15:25,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:15:25,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:15:25,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,549 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-03 23:15:25,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:15:25,556 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:15:25,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:15:25,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:15:25,557 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (1/1) ... [2025-03-03 23:15:25,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:25,584 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-03 23:15:25,590 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-03 23:15:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:15:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:15:25,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:15:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:15:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:15:25,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:15:25,647 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:15:25,648 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:15:25,808 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:15:25,808 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:15:25,816 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:15:25,816 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:15:25,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:25 BoogieIcfgContainer [2025-03-03 23:15:25,816 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:15:25,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:15:25,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:15:25,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:15:25,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:25" (1/3) ... [2025-03-03 23:15:25,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49355c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:25, skipping insertion in model container [2025-03-03 23:15:25,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:25" (2/3) ... [2025-03-03 23:15:25,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49355c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:25, skipping insertion in model container [2025-03-03 23:15:25,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:25" (3/3) ... [2025-03-03 23:15:25,823 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-94.i [2025-03-03 23:15:25,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:15:25,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-94.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:15:25,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:15:25,888 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;@7157f61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:15:25,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:15:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:15:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 23:15:25,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:25,904 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:15:25,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:25,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1645075150, now seen corresponding path program 1 times [2025-03-03 23:15:25,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:25,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764890183] [2025-03-03 23:15:25,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:25,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:25,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 23:15:26,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 23:15:26,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:26,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-03 23:15:26,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:26,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764890183] [2025-03-03 23:15:26,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764890183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:15:26,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570540413] [2025-03-03 23:15:26,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:26,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:15:26,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:26,097 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-03 23:15:26,098 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-03 23:15:26,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 23:15:26,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 23:15:26,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:26,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:26,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:15:26,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-03 23:15:26,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570540413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:15:26,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:15:26,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298904565] [2025-03-03 23:15:26,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:26,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:15:26,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:26,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:15:26,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:26,253 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:15:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:26,271 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2025-03-03 23:15:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:15:26,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-03-03 23:15:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:26,277 INFO L225 Difference]: With dead ends: 113 [2025-03-03 23:15:26,277 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 23:15:26,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-03 23:15:26,282 INFO L435 NwaCegarLoop]: 84 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, 84 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-03 23:15:26,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 23:15:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 23:15:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:15:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-03-03 23:15:26,313 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 131 [2025-03-03 23:15:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:26,313 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-03-03 23:15:26,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:15:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-03-03 23:15:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 23:15:26,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:26,317 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:15:26,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:15:26,518 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-03 23:15:26,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:26,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:26,519 INFO L85 PathProgramCache]: Analyzing trace with hash -267471219, now seen corresponding path program 1 times [2025-03-03 23:15:26,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:26,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892667396] [2025-03-03 23:15:26,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:26,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:26,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 23:15:26,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 23:15:26,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:26,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:26,635 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:15:26,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 23:15:26,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 23:15:26,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:26,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:26,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:15:26,752 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:15:26,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:15:26,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:15:26,756 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:15:26,812 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:15:26,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:15:26 BoogieIcfgContainer [2025-03-03 23:15:26,815 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:15:26,815 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:15:26,815 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:15:26,815 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:15:26,816 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:25" (3/4) ... [2025-03-03 23:15:26,818 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:15:26,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:15:26,819 INFO L158 Benchmark]: Toolchain (without parser) took 1562.70ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 105.8MB in the end (delta: 16.2MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2025-03-03 23:15:26,819 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:26,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.76ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 109.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:26,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.17ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:26,820 INFO L158 Benchmark]: Boogie Preprocessor took 30.67ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 105.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:26,822 INFO L158 Benchmark]: IcfgBuilder took 260.20ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 89.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:15:26,822 INFO L158 Benchmark]: TraceAbstraction took 996.86ms. Allocated memory is still 167.8MB. Free memory was 89.4MB in the beginning and 106.8MB in the end (delta: -17.5MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2025-03-03 23:15:26,822 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 105.8MB in the end (delta: 994.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:26,823 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.23ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.76ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 109.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.17ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.67ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 105.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 260.20ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 89.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 996.86ms. Allocated memory is still 167.8MB. Free memory was 89.4MB in the beginning and 106.8MB in the end (delta: -17.5MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 105.8MB in the end (delta: 994.8kB). 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 someBinaryArithmeticDOUBLEoperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 42, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 63.4; [L23] float var_1_2 = 25.2; [L24] float var_1_3 = 3.75; [L25] double var_1_4 = 0.0; [L26] double var_1_5 = 63.4; [L27] double var_1_6 = 3.7; [L28] unsigned char var_1_7 = 0; [L29] double var_1_8 = 63.75; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] signed char var_1_11 = -64; [L33] signed char var_1_12 = -32; [L34] signed char var_1_13 = 2; [L35] signed char var_1_14 = -4; [L36] signed char var_1_15 = -25; [L37] signed char var_1_16 = 5; [L38] signed long int var_1_17 = -2; VAL [isInitial=0, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_2=126/5, var_1_3=15/4, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L106] isInitial = 1 [L107] FCALL initially() [L108] int k_loop; [L109] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_2=126/5, var_1_3=15/4, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L109] COND TRUE k_loop < 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_3=15/4, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_3=15/4, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L65] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_3=15/4, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L66] var_1_3 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L67] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_4=0, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L68] var_1_4 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_4 >= 4611686.018427382800e+12F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L69] RET assume_abort_if_not((var_1_4 >= 4611686.018427382800e+12F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_5=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L70] var_1_5 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L71] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_6=37/10, var_1_7=0, var_1_8=255/4, var_1_9=0] [L72] var_1_6 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_8=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_8=255/4, var_1_9=0] [L73] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_8=255/4, var_1_9=0] [L74] var_1_8 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L75] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_8 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_8 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=0] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L78] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L79] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L79] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L82] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L82] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=-32, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L84] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=2, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L87] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L88] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L88] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-4, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L89] var_1_14 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L90] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L91] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L91] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=-25, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L92] var_1_15 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_15 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L93] RET assume_abort_if_not(var_1_15 >= -31) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L94] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L94] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=5, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L95] var_1_16 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_16 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L96] RET assume_abort_if_not(var_1_16 >= -31) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L97] CALL assume_abort_if_not(var_1_16 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L97] RET assume_abort_if_not(var_1_16 <= 31) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_1=317/5, var_1_7=0, var_1_9=257] [L111] RET updateVariables() [L112] CALL step() [L42] COND TRUE var_1_2 != var_1_3 [L43] var_1_1 = ((var_1_4 - var_1_5) - var_1_6) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=257] [L45] COND FALSE !(var_1_5 > (var_1_1 / var_1_4)) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=257] [L52] COND TRUE var_1_10 || var_1_9 [L53] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=126, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=257] [L57] COND FALSE !(var_1_6 > var_1_5) VAL [isInitial=1, var_1_10=0, var_1_11=126, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=257] [L112] RET step() [L113] CALL, EXPR property() [L102-L103] return ((((var_1_2 != var_1_3) ? (var_1_1 == ((double) ((var_1_4 - var_1_5) - var_1_6))) : 1) && ((var_1_5 > (var_1_1 / var_1_4)) ? ((var_1_5 > (var_1_4 / var_1_8)) ? (var_1_7 == ((unsigned char) var_1_9)) : (var_1_7 == ((unsigned char) var_1_10))) : 1)) && ((var_1_10 || var_1_9) ? (var_1_11 == ((signed char) var_1_12)) : (var_1_11 == ((signed char) (((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + (var_1_15 + var_1_16)))))) && ((var_1_6 > var_1_5) ? ((var_1_1 != (var_1_4 / var_1_8)) ? (var_1_17 == ((signed long int) var_1_16)) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=126, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=257] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=126, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=257] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=126, var_1_12=126, var_1_13=-62, var_1_14=-63, var_1_15=30, var_1_16=31, var_1_17=-2, var_1_7=0, var_1_9=257] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 84 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, 84 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1640/1680 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-03 23:15:26,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-94.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 60036eeb32f319b97447b54d2424c6e2924357980a7a83b9a9490038fdc9d6d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:28,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:28,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:15:28,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:28,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:28,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:28,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:28,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:28,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:28,737 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:28,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:28,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:28,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:28,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:28,738 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:28,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:28,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:28,738 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:28,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:28,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:28,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:28,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:28,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:28,739 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:15:28,739 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:15:28,739 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:15:28,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:28,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:28,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:28,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:28,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:28,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:28,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:28,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:28,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:28,741 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 -> 60036eeb32f319b97447b54d2424c6e2924357980a7a83b9a9490038fdc9d6d3 [2025-03-03 23:15:28,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:28,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:28,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:28,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:28,988 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:28,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-94.i [2025-03-03 23:15:30,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecfae2a8/6146fd25a5814bd5bb67b9bbf5c620bf/FLAGc949561cd [2025-03-03 23:15:30,340 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:30,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-94.i [2025-03-03 23:15:30,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecfae2a8/6146fd25a5814bd5bb67b9bbf5c620bf/FLAGc949561cd [2025-03-03 23:15:30,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecfae2a8/6146fd25a5814bd5bb67b9bbf5c620bf [2025-03-03 23:15:30,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:15:30,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:15:30,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:30,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:15:30,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:15:30,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5b4ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30, skipping insertion in model container [2025-03-03 23:15:30,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:15:30,807 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_loopvsstraightlinecode_25-1loop_file-94.i[915,928] [2025-03-03 23:15:30,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:30,853 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:15:30,860 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_loopvsstraightlinecode_25-1loop_file-94.i[915,928] [2025-03-03 23:15:30,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:30,887 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:15:30,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30 WrapperNode [2025-03-03 23:15:30,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:30,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:30,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:15:30,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:15:30,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,929 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2025-03-03 23:15:30,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:30,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:15:30,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:15:30,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:15:30,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,955 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-03 23:15:30,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:15:30,982 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:15:30,982 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:15:30,982 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:15:30,983 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (1/1) ... [2025-03-03 23:15:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:31,007 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-03 23:15:31,009 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-03 23:15:31,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:15:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:15:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:15:31,025 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:15:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:15:31,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:15:31,082 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:15:31,084 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:15:55,386 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:15:55,386 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:15:55,395 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:15:55,396 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:15:55,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:55 BoogieIcfgContainer [2025-03-03 23:15:55,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:15:55,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:15:55,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:15:55,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:15:55,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:30" (1/3) ... [2025-03-03 23:15:55,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c82c692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:55, skipping insertion in model container [2025-03-03 23:15:55,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:30" (2/3) ... [2025-03-03 23:15:55,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c82c692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:55, skipping insertion in model container [2025-03-03 23:15:55,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:55" (3/3) ... [2025-03-03 23:15:55,403 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-94.i [2025-03-03 23:15:55,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:15:55,414 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-94.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:15:55,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:15:55,456 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;@3b6d92ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:15:55,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:15:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:15:55,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 23:15:55,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:55,468 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:15:55,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:55,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1645075150, now seen corresponding path program 1 times [2025-03-03 23:15:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:55,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282763346] [2025-03-03 23:15:55,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:55,480 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-03 23:15:55,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:55,482 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-03 23:15:55,484 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-03 23:15:55,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 23:15:56,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 23:15:56,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:56,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:56,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:15:56,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2025-03-03 23:15:56,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:56,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:56,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282763346] [2025-03-03 23:15:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282763346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:56,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:15:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061948169] [2025-03-03 23:15:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:56,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:15:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:56,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:15:56,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:56,928 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:15:56,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:56,947 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2025-03-03 23:15:56,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:15:56,948 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-03-03 23:15:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:56,952 INFO L225 Difference]: With dead ends: 113 [2025-03-03 23:15:56,952 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 23:15:56,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-03 23:15:56,958 INFO L435 NwaCegarLoop]: 84 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, 84 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-03 23:15:56,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 23:15:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 23:15:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:15:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-03-03 23:15:56,985 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 131 [2025-03-03 23:15:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:56,985 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-03-03 23:15:56,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:15:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-03-03 23:15:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 23:15:56,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:56,990 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:15:57,022 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-03 23:15:57,190 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-03 23:15:57,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:57,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash -267471219, now seen corresponding path program 1 times [2025-03-03 23:15:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:57,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674170700] [2025-03-03 23:15:57,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:57,192 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-03 23:15:57,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:57,194 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-03 23:15:57,195 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-03 23:15:57,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 23:15:58,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 23:15:58,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:58,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:58,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 23:15:58,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:17:11,211 WARN L286 SmtUtils]: Spent 12.44s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)