./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.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 471646664bde209a2d055afa13c4b9792441594ee5a58aa96bbccbdd9caad8c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:35:31,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:35:31,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:35:31,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:35:31,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:35:31,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:35:31,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:35:31,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:35:31,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:35:31,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:35:31,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:35:31,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:35:31,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:35:31,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:35:31,894 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:35:31,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:35:31,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:35:31,894 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:35:31,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:35:31,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:35:31,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:35:31,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:35:31,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:35:31,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:35:31,895 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:35:31,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:35:31,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:35:31,895 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:35:31,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:35:31,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:35:31,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:35:31,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:35:31,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:35:31,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:35:31,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:35:31,896 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:35:31,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:35:31,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:35:31,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:35:31,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:35:31,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:35:31,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:35:31,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:35:31,897 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 -> 471646664bde209a2d055afa13c4b9792441594ee5a58aa96bbccbdd9caad8c6 [2025-03-17 03:35:32,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:35:32,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:35:32,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:35:32,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:35:32,119 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:35:32,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.i [2025-03-17 03:35:33,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc73162c2/7a3322cdffd3426e872837421f47a807/FLAG476562d5f [2025-03-17 03:35:33,435 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:35:33,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.i [2025-03-17 03:35:33,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc73162c2/7a3322cdffd3426e872837421f47a807/FLAG476562d5f [2025-03-17 03:35:33,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc73162c2/7a3322cdffd3426e872837421f47a807 [2025-03-17 03:35:33,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:35:33,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:35:33,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:35:33,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:35:33,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:35:33,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:33,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e365b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33, skipping insertion in model container [2025-03-17 03:35:33,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:33,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:35:33,896 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-while_file-11.i[915,928] [2025-03-17 03:35:33,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:35:33,945 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:35:33,953 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-while_file-11.i[915,928] [2025-03-17 03:35:33,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:35:33,980 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:35:33,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33 WrapperNode [2025-03-17 03:35:33,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:35:33,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:35:33,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:35:33,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:35:33,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:33,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,004 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2025-03-17 03:35:34,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:35:34,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:35:34,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:35:34,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:35:34,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,019 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:35:34,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,022 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:35:34,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:35:34,026 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:35:34,026 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:35:34,026 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (1/1) ... [2025-03-17 03:35:34,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:35:34,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:35:34,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:35:34,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:35:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:35:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:35:34,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:35:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:35:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:35:34,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:35:34,107 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:35:34,108 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:35:34,253 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:35:34,254 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:35:34,261 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:35:34,261 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:35:34,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:35:34 BoogieIcfgContainer [2025-03-17 03:35:34,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:35:34,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:35:34,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:35:34,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:35:34,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:35:33" (1/3) ... [2025-03-17 03:35:34,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695d986b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:35:34, skipping insertion in model container [2025-03-17 03:35:34,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:33" (2/3) ... [2025-03-17 03:35:34,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695d986b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:35:34, skipping insertion in model container [2025-03-17 03:35:34,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:35:34" (3/3) ... [2025-03-17 03:35:34,269 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-11.i [2025-03-17 03:35:34,279 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:35:34,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-11.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:35:34,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:35:34,330 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;@1ce866df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:35:34,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:35:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:35:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:35:34,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:35:34,344 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:35:34,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:35:34,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:35:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash 692017766, now seen corresponding path program 1 times [2025-03-17 03:35:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:35:34,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667392642] [2025-03-17 03:35:34,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:34,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:35:34,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:35:34,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:35:34,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:34,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 03:35:34,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:35:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667392642] [2025-03-17 03:35:34,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667392642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:35:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869653057] [2025-03-17 03:35:34,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:34,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:35:34,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:35:34,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:35:34,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:35:34,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:35:34,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:35:34,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:34,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:34,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:35:34,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:35:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 03:35:34,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:35:34,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869653057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:35:34,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:35:34,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:35:34,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308447769] [2025-03-17 03:35:34,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:35:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:35:34,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:35:34,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:35:34,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:35:34,695 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:35:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:35:34,708 INFO L93 Difference]: Finished difference Result 99 states and 173 transitions. [2025-03-17 03:35:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:35:34,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2025-03-17 03:35:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:35:34,713 INFO L225 Difference]: With dead ends: 99 [2025-03-17 03:35:34,713 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 03:35:34,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:35:34,717 INFO L435 NwaCegarLoop]: 74 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, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:35:34,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:35:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 03:35:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 03:35:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:35:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2025-03-17 03:35:34,742 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 115 [2025-03-17 03:35:34,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:35:34,744 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2025-03-17 03:35:34,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:35:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2025-03-17 03:35:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:35:34,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:35:34,749 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:35:34,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:35:34,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:35:34,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:35:34,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:35:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1754805117, now seen corresponding path program 1 times [2025-03-17 03:35:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:35:34,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549627350] [2025-03-17 03:35:34,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:34,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:35:34,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:35:35,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:35:35,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:35,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:35:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222322073] [2025-03-17 03:35:35,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:35,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:35:35,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:35:35,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:35:35,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:35:35,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:35:35,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:35:35,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:35,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:35:35,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:35:35,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:35:35,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:35:35,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:35,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:35:35,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:35:35,318 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:35:35,319 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:35:35,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 03:35:35,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 03:35:35,524 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:35:35,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:35:35,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:35:35 BoogieIcfgContainer [2025-03-17 03:35:35,591 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:35:35,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:35:35,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:35:35,593 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:35:35,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:35:34" (3/4) ... [2025-03-17 03:35:35,596 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:35:35,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:35:35,597 INFO L158 Benchmark]: Toolchain (without parser) took 1815.11ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 116.1MB in the end (delta: 16.9MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-03-17 03:35:35,597 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:35:35,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.09ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 120.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:35:35,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.08ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 118.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:35:35,599 INFO L158 Benchmark]: Boogie Preprocessor took 20.65ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 116.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:35:35,601 INFO L158 Benchmark]: IcfgBuilder took 236.10ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 100.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:35:35,601 INFO L158 Benchmark]: TraceAbstraction took 1327.84ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 116.1MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:35:35,601 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 116.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:35:35,602 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.09ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 120.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.08ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 118.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.65ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 116.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 236.10ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 100.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1327.84ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 116.1MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 116.1MB in the end (delta: 50.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 someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] double var_1_2 = 50.75; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_7 = 10; [L27] float var_1_8 = 32.5; [L28] float var_1_9 = 1000000.7; [L29] float var_1_10 = 1.2; [L30] unsigned short int var_1_11 = 256; [L31] signed long int var_1_12 = -64; [L32] signed long int var_1_13 = -16; [L33] unsigned short int var_1_14 = 56281; [L34] unsigned short int var_1_15 = 32; [L35] float last_1_var_1_8 = 32.5; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_8 = var_1_8 [L105] RET updateLastVariables() [L106] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L65] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2, var_1_9=10000007/10] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2, var_1_9=10000007/10] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2, var_1_9=10000007/10] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2, var_1_9=10000007/10] [L75] var_1_9 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L76] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L77] var_1_10 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L78] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L79] var_1_12 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L80] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L81] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L81] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L82] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L82] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L83] var_1_13 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L84] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L85] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L85] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L86] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L86] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L87] var_1_14 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L88] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L89] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L89] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L90] var_1_15 = __VERIFIER_nondet_ushort() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L92] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L92] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L106] RET updateVariables() [L107] CALL step() [L39] COND FALSE !(last_1_var_1_8 >= var_1_2) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L48] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=-255, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L49] COND FALSE !((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=-255, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L58] signed long int stepLocal_1 = var_1_1 / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))); VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=-255, stepLocal_1=-16, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L59] COND TRUE stepLocal_1 < var_1_7 [L60] var_1_11 = (var_1_14 - var_1_15) VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=-255, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) ? ((var_1_5 && var_1_6) ? ((var_1_8 < var_1_8) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : 1) : 1) && ((last_1_var_1_8 >= var_1_2) ? (var_1_6 ? ((! var_1_5) ? (var_1_8 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : (var_1_8 == ((float) var_1_9))) : 1) : 1)) && (((var_1_1 / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13)))) < var_1_7) ? (var_1_11 == ((unsigned short int) (var_1_14 - var_1_15))) : 1) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=-255, var_1_6=1, var_1_7=-15, var_1_8=65/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 97 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 19, 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, 74 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, 74 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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.3s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 460 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1332/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:35:35,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.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 471646664bde209a2d055afa13c4b9792441594ee5a58aa96bbccbdd9caad8c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:35:37,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:35:37,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:35:37,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:35:37,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:35:37,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:35:37,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:35:37,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:35:37,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:35:37,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:35:37,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:35:37,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:35:37,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:35:37,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:35:37,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:35:37,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:35:37,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:35:37,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:35:37,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:35:37,467 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:35:37,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:35:37,467 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:35:37,467 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:35:37,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:35:37,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:35:37,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:35:37,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:35:37,467 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 -> 471646664bde209a2d055afa13c4b9792441594ee5a58aa96bbccbdd9caad8c6 [2025-03-17 03:35:37,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:35:37,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:35:37,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:35:37,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:35:37,719 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:35:37,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.i [2025-03-17 03:35:38,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bd550eb/16fa01a457af4cf3b88085daa3d62bc8/FLAG1950e898f [2025-03-17 03:35:39,054 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:35:39,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.i [2025-03-17 03:35:39,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bd550eb/16fa01a457af4cf3b88085daa3d62bc8/FLAG1950e898f [2025-03-17 03:35:39,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bd550eb/16fa01a457af4cf3b88085daa3d62bc8 [2025-03-17 03:35:39,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:35:39,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:35:39,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:35:39,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:35:39,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:35:39,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e9c2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39, skipping insertion in model container [2025-03-17 03:35:39,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:35:39,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.i[915,928] [2025-03-17 03:35:39,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:35:39,617 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:35:39,627 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-while_file-11.i[915,928] [2025-03-17 03:35:39,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:35:39,667 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:35:39,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39 WrapperNode [2025-03-17 03:35:39,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:35:39,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:35:39,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:35:39,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:35:39,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,700 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-17 03:35:39,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:35:39,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:35:39,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:35:39,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:35:39,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,719 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:35:39,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:35:39,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:35:39,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:35:39,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:35:39,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (1/1) ... [2025-03-17 03:35:39,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:35:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:35:39,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:35:39,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:35:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:35:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:35:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:35:39,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:35:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:35:39,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:35:39,834 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:35:39,835 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:35:52,689 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:35:52,690 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:35:52,696 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:35:52,696 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:35:52,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:35:52 BoogieIcfgContainer [2025-03-17 03:35:52,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:35:52,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:35:52,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:35:52,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:35:52,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:35:39" (1/3) ... [2025-03-17 03:35:52,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c46fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:35:52, skipping insertion in model container [2025-03-17 03:35:52,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:39" (2/3) ... [2025-03-17 03:35:52,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c46fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:35:52, skipping insertion in model container [2025-03-17 03:35:52,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:35:52" (3/3) ... [2025-03-17 03:35:52,704 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-11.i [2025-03-17 03:35:52,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:35:52,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-11.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:35:52,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:35:52,759 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;@5aa4693c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:35:52,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:35:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:35:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:35:52,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:35:52,783 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:35:52,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:35:52,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:35:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 692017766, now seen corresponding path program 1 times [2025-03-17 03:35:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:35:52,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559647282] [2025-03-17 03:35:52,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:52,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:35:52,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:35:52,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:35:52,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:35:52,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:35:53,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:35:53,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:53,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:53,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:35:53,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:35:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 03:35:53,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:35:53,296 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:35:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559647282] [2025-03-17 03:35:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559647282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:35:53,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:35:53,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:35:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920415973] [2025-03-17 03:35:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:35:53,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:35:53,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:35:53,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:35:53,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:35:53,313 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:35:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:35:53,327 INFO L93 Difference]: Finished difference Result 99 states and 173 transitions. [2025-03-17 03:35:53,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:35:53,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2025-03-17 03:35:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:35:53,332 INFO L225 Difference]: With dead ends: 99 [2025-03-17 03:35:53,332 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 03:35:53,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:35:53,338 INFO L435 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:35:53,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:35:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 03:35:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 03:35:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:35:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2025-03-17 03:35:53,367 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 115 [2025-03-17 03:35:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:35:53,368 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2025-03-17 03:35:53,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:35:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2025-03-17 03:35:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:35:53,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:35:53,373 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:35:53,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:35:53,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:35:53,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:35:53,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:35:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1754805117, now seen corresponding path program 1 times [2025-03-17 03:35:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:35:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496811734] [2025-03-17 03:35:53,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:53,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:35:53,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:35:53,577 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:35:53,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:35:53,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:35:54,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:35:54,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:54,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:54,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:35:54,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:02,796 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:36:10,998 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:36:15,057 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from false [2025-03-17 03:36:19,122 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from true [2025-03-17 03:36:27,270 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:36:35,504 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:36:43,656 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:36:51,903 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:37:00,862 WARN L851 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from false [2025-03-17 03:37:04,943 WARN L873 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from true