./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.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 47a9580359f4ce533ffae805fbaa0b559dfa198618e852328ee6cb0ba7f4c377 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:41:11,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:41:11,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:41:11,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:41:11,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:41:11,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:41:11,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:41:11,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:41:11,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:41:11,894 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:41:11,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:41:11,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:41:11,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:41:11,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:41:11,896 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:41:11,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:41:11,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:41:11,896 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:41:11,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:41:11,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:41:11,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:41:11,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:41:11,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:41:11,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:41:11,897 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:41:11,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:41:11,897 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:41:11,897 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:41:11,897 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:41:11,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:41:11,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:41:11,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:41:11,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:41:11,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:41:11,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:41:11,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:41:11,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:41:11,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:41:11,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:41:11,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:41:11,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:41:11,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:41:11,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:41:11,898 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 -> 47a9580359f4ce533ffae805fbaa0b559dfa198618e852328ee6cb0ba7f4c377 [2025-03-03 22:41:12,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:41:12,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:41:12,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:41:12,143 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:41:12,143 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:41:12,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.i [2025-03-03 22:41:13,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9020632/3f9fcec74a204552a1acd76322717b88/FLAGa4e2d9bcc [2025-03-03 22:41:13,511 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:41:13,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.i [2025-03-03 22:41:13,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9020632/3f9fcec74a204552a1acd76322717b88/FLAGa4e2d9bcc [2025-03-03 22:41:13,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9020632/3f9fcec74a204552a1acd76322717b88 [2025-03-03 22:41:13,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:41:13,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:41:13,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:41:13,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:41:13,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:41:13,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:41:13" (1/1) ... [2025-03-03 22:41:13,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4448f301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:13, skipping insertion in model container [2025-03-03 22:41:13,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:41:13" (1/1) ... [2025-03-03 22:41:13,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:41:13,929 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_floatingpointinfluence_no-floats_file-93.i[916,929] [2025-03-03 22:41:13,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:41:13,981 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:41:13,989 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_floatingpointinfluence_no-floats_file-93.i[916,929] [2025-03-03 22:41:14,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:41:14,024 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:41:14,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14 WrapperNode [2025-03-03 22:41:14,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:41:14,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:41:14,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:41:14,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:41:14,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,056 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-03 22:41:14,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:41:14,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:41:14,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:41:14,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:41:14,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,072 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:41:14,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,075 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:41:14,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:41:14,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:41:14,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:41:14,080 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (1/1) ... [2025-03-03 22:41:14,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:41:14,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:41:14,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:41:14,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:41:14,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:41:14,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:41:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:41:14,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:41:14,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:41:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:41:14,168 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:41:14,170 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:41:14,339 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:41:14,339 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:41:14,347 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:41:14,347 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:41:14,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:14 BoogieIcfgContainer [2025-03-03 22:41:14,347 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:41:14,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:41:14,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:41:14,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:41:14,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:41:13" (1/3) ... [2025-03-03 22:41:14,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5491776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:41:14, skipping insertion in model container [2025-03-03 22:41:14,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:14" (2/3) ... [2025-03-03 22:41:14,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5491776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:41:14, skipping insertion in model container [2025-03-03 22:41:14,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:14" (3/3) ... [2025-03-03 22:41:14,354 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-93.i [2025-03-03 22:41:14,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:41:14,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-93.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:41:14,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:41:14,415 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;@7b24d72b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:41:14,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:41:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:41:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 22:41:14,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:14,430 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:41:14,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:14,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1182516422, now seen corresponding path program 1 times [2025-03-03 22:41:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707493997] [2025-03-03 22:41:14,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:14,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:14,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 22:41:14,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 22:41:14,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:14,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:41:14,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707493997] [2025-03-03 22:41:14,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707493997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:41:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74223275] [2025-03-03 22:41:14,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:14,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:41:14,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:41:14,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:41:14,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:41:14,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 22:41:14,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 22:41:14,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:14,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:14,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:41:14,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:41:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:41:14,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:41:14,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74223275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:14,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:41:14,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:41:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585900346] [2025-03-03 22:41:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:14,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:41:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:14,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:41:14,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:41:14,806 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:41:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:14,827 INFO L93 Difference]: Finished difference Result 98 states and 171 transitions. [2025-03-03 22:41:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:41:14,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2025-03-03 22:41:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:14,832 INFO L225 Difference]: With dead ends: 98 [2025-03-03 22:41:14,832 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 22:41:14,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:41:14,836 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-03 22:41:14,837 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-03 22:41:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 22:41:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 22:41:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:41:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2025-03-03 22:41:14,876 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 121 [2025-03-03 22:41:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:14,876 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2025-03-03 22:41:14,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:41:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2025-03-03 22:41:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 22:41:14,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:14,881 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:41:14,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:41:15,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:41:15,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash 318232792, now seen corresponding path program 1 times [2025-03-03 22:41:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:15,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274935796] [2025-03-03 22:41:15,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:15,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:15,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 22:41:15,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 22:41:15,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:15,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:41:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480648766] [2025-03-03 22:41:15,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:15,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:41:15,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:41:15,248 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-03 22:41:15,248 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-03 22:41:15,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 22:41:15,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 22:41:15,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:15,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:41:15,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:41:15,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 22:41:15,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 22:41:15,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:15,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:41:15,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:41:15,435 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:41:15,436 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:41:15,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:41:15,638 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-03 22:41:15,640 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 22:41:15,707 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:41:15,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:41:15 BoogieIcfgContainer [2025-03-03 22:41:15,709 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:41:15,710 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:41:15,710 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:41:15,710 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:41:15,710 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:14" (3/4) ... [2025-03-03 22:41:15,714 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:41:15,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:41:15,715 INFO L158 Benchmark]: Toolchain (without parser) took 1906.09ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 71.7MB in the end (delta: 37.5MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2025-03-03 22:41:15,716 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:41:15,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.06ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 97.0MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:41:15,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.54ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:41:15,717 INFO L158 Benchmark]: Boogie Preprocessor took 21.74ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 92.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:41:15,718 INFO L158 Benchmark]: IcfgBuilder took 268.63ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 77.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:41:15,718 INFO L158 Benchmark]: TraceAbstraction took 1360.28ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 71.8MB in the end (delta: 4.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2025-03-03 22:41:15,718 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 71.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:41:15,719 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.06ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 97.0MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.54ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.74ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 92.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 268.63ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 77.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1360.28ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 71.8MB in the end (delta: 4.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 4.99ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 71.7MB in the end (delta: 41.6kB). 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 to_int at line 95, overapproximation of to_int at line 45, overapproximation of to_int at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 255; [L23] signed long int var_1_3 = 0; [L24] signed long int var_1_5 = 128; [L25] signed long int var_1_6 = 9; [L26] signed long int var_1_7 = 31; [L27] signed long int var_1_8 = 9; [L28] signed long int var_1_9 = 499; [L29] signed long int var_1_10 = 1; [L30] unsigned char var_1_11 = 0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] signed long int last_1_var_1_10 = 1; VAL [isInitial=0, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=0, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=0, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_long() [L62] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L62] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L63] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L63] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L64] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L64] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L65] var_1_5 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L66] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L67] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L67] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L68] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L68] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L69] var_1_6 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L71] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L71] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L74] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L75] var_1_8 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L77] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L77] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L82] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L83] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L83] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L84] var_1_13 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L85] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L86] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L86] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L87] var_1_14 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L88] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L89] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L89] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L103] RET updateVariables() [L104] CALL step() [L38] COND FALSE !(((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) [L45] var_1_1 = 64.51f VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L47] COND TRUE var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1)))) [L48] var_1_10 = 2147000000.0f VAL [isInitial=1, last_1_var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L52] COND TRUE ! (var_1_3 <= var_1_10) [L53] var_1_11 = (var_1_12 && var_1_13) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return (((((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) ? ((last_1_var_1_10 != (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - var_1_8)) ? (var_1_1 == ((signed long int) var_1_9)) : (var_1_1 == ((signed long int) var_1_9))) : (var_1_1 == ((signed long int) 64.51f))) && ((var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1))))) ? (var_1_10 == ((signed long int) 1.00000000000004E13f)) : (var_1_10 == ((signed long int) var_1_9)))) && ((! (var_1_3 <= var_1_10)) ? (var_1_11 == ((unsigned char) (var_1_12 && var_1_13))) : (((var_1_7 / var_1_3) < ((((((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) < (var_1_5)) ? (((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) : (var_1_5)))) ? (var_1_11 == ((unsigned char) var_1_14)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=20, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=20, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=20, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 20, 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, 73 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, 73 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred 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.2s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 269 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1482/1520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:41:15,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.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 47a9580359f4ce533ffae805fbaa0b559dfa198618e852328ee6cb0ba7f4c377 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:41:17,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:41:17,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:41:17,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:41:17,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:41:17,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:41:17,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:41:17,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:41:17,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:41:17,690 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:41:17,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:41:17,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:41:17,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:41:17,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:41:17,692 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:41:17,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:41:17,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:41:17,692 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:41:17,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:41:17,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:41:17,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:41:17,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:41:17,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:41:17,693 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:41:17,693 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:41:17,693 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:41:17,693 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:41:17,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:41:17,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:41:17,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:41:17,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:41:17,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:41:17,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:41:17,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:41:17,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:41:17,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:41:17,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:41:17,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:41:17,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:41:17,695 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:41:17,695 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:41:17,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:41:17,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:41:17,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:41:17,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:41:17,695 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 -> 47a9580359f4ce533ffae805fbaa0b559dfa198618e852328ee6cb0ba7f4c377 [2025-03-03 22:41:17,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:41:17,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:41:17,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:41:17,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:41:17,911 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:41:17,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.i [2025-03-03 22:41:19,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0076e8240/e0e5139a7c1c4d6b9dbdce4339cf2d48/FLAG0f761b661 [2025-03-03 22:41:19,177 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:41:19,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.i [2025-03-03 22:41:19,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0076e8240/e0e5139a7c1c4d6b9dbdce4339cf2d48/FLAG0f761b661 [2025-03-03 22:41:19,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0076e8240/e0e5139a7c1c4d6b9dbdce4339cf2d48 [2025-03-03 22:41:19,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:41:19,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:41:19,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:41:19,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:41:19,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:41:19,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6ed732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19, skipping insertion in model container [2025-03-03 22:41:19,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:41:19,695 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_floatingpointinfluence_no-floats_file-93.i[916,929] [2025-03-03 22:41:19,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:41:19,746 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:41:19,755 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_floatingpointinfluence_no-floats_file-93.i[916,929] [2025-03-03 22:41:19,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:41:19,778 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:41:19,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19 WrapperNode [2025-03-03 22:41:19,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:41:19,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:41:19,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:41:19,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:41:19,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,816 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-03 22:41:19,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:41:19,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:41:19,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:41:19,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:41:19,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,840 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:41:19,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:41:19,860 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:41:19,860 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:41:19,860 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:41:19,861 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (1/1) ... [2025-03-03 22:41:19,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:41:19,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:41:19,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:41:19,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:41:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:41:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:41:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:41:19,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:41:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:41:19,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:41:19,963 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:41:19,965 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:41:32,822 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:41:32,822 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:41:32,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:41:32,829 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:41:32,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:32 BoogieIcfgContainer [2025-03-03 22:41:32,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:41:32,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:41:32,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:41:32,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:41:32,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:41:19" (1/3) ... [2025-03-03 22:41:32,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7148a526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:41:32, skipping insertion in model container [2025-03-03 22:41:32,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:19" (2/3) ... [2025-03-03 22:41:32,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7148a526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:41:32, skipping insertion in model container [2025-03-03 22:41:32,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:32" (3/3) ... [2025-03-03 22:41:32,836 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-93.i [2025-03-03 22:41:32,846 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:41:32,847 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-93.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:41:32,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:41:32,888 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6183b294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:41:32,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:41:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:41:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 22:41:32,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:32,902 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:41:32,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:32,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1182516422, now seen corresponding path program 1 times [2025-03-03 22:41:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:41:32,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287535117] [2025-03-03 22:41:32,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:32,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:41:32,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:41:32,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:41:32,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:41:32,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 22:41:33,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 22:41:33,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:33,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:33,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:41:33,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:41:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-03 22:41:33,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:41:33,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:41:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287535117] [2025-03-03 22:41:33,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287535117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:33,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:33,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:41:33,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972566640] [2025-03-03 22:41:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:33,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:41:33,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:41:33,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:41:33,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:41:33,319 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:41:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:33,337 INFO L93 Difference]: Finished difference Result 98 states and 171 transitions. [2025-03-03 22:41:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:41:33,338 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2025-03-03 22:41:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:33,343 INFO L225 Difference]: With dead ends: 98 [2025-03-03 22:41:33,344 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 22:41:33,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:41:33,364 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-03 22:41:33,364 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-03 22:41:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 22:41:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 22:41:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:41:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2025-03-03 22:41:33,396 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 121 [2025-03-03 22:41:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:33,396 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2025-03-03 22:41:33,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:41:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2025-03-03 22:41:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 22:41:33,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:33,398 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:41:33,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:41:33,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:41:33,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:33,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash 318232792, now seen corresponding path program 1 times [2025-03-03 22:41:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:41:33,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645140598] [2025-03-03 22:41:33,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:33,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:41:33,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:41:33,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:41:33,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:41:33,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 22:41:33,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 22:41:33,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:33,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:41:33,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:41:34,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 22:41:34,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 22:41:34,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:34,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:41:34,401 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-03 22:41:34,402 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:41:34,403 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:41:34,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 22:41:34,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:41:34,607 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 22:41:34,662 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:41:34,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:41:34 BoogieIcfgContainer [2025-03-03 22:41:34,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:41:34,666 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:41:34,666 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:41:34,666 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:41:34,667 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:32" (3/4) ... [2025-03-03 22:41:34,667 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 22:41:34,727 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 75. [2025-03-03 22:41:34,787 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 22:41:34,788 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 22:41:34,788 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:41:34,788 INFO L158 Benchmark]: Toolchain (without parser) took 15199.99ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 51.6MB in the end (delta: 40.8MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2025-03-03 22:41:34,789 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:41:34,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.92ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.3MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:41:34,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.12ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:41:34,789 INFO L158 Benchmark]: Boogie Preprocessor took 42.22ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:41:34,789 INFO L158 Benchmark]: IcfgBuilder took 12969.86ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 60.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:41:34,790 INFO L158 Benchmark]: TraceAbstraction took 1833.08ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 66.2MB in the end (delta: -6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:41:34,790 INFO L158 Benchmark]: Witness Printer took 121.95ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 51.6MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:41:34,791 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.92ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.3MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.12ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.22ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 12969.86ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 60.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1833.08ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 66.2MB in the end (delta: -6.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 121.95ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 51.6MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 255; [L23] signed long int var_1_3 = 0; [L24] signed long int var_1_5 = 128; [L25] signed long int var_1_6 = 9; [L26] signed long int var_1_7 = 31; [L27] signed long int var_1_8 = 9; [L28] signed long int var_1_9 = 499; [L29] signed long int var_1_10 = 1; [L30] unsigned char var_1_11 = 0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] signed long int last_1_var_1_10 = 1; VAL [isInitial=0, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=0, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=0, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_long() [L62] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L62] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L63] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L63] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L64] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L64] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L65] var_1_5 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L66] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L67] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L67] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L68] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L68] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L69] var_1_6 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L71] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L71] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L74] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L75] var_1_8 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L77] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L77] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L82] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L83] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L83] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L84] var_1_13 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L85] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L86] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L86] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L87] var_1_14 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L88] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L89] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L89] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L103] RET updateVariables() [L104] CALL step() [L38] COND FALSE !(((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) [L45] var_1_1 = 64.51f VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L47] COND TRUE var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1)))) [L48] var_1_10 = 2147000000.0f VAL [isInitial=1, last_1_var_1_10=1, var_1_10=2147000064, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L52] COND TRUE ! (var_1_3 <= var_1_10) [L53] var_1_11 = (var_1_12 && var_1_13) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=2147000064, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return (((((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) ? ((last_1_var_1_10 != (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - var_1_8)) ? (var_1_1 == ((signed long int) var_1_9)) : (var_1_1 == ((signed long int) var_1_9))) : (var_1_1 == ((signed long int) 64.51f))) && ((var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1))))) ? (var_1_10 == ((signed long int) 1.00000000000004E13f)) : (var_1_10 == ((signed long int) var_1_9)))) && ((! (var_1_3 <= var_1_10)) ? (var_1_11 == ((unsigned char) (var_1_12 && var_1_13))) : (((var_1_7 / var_1_3) < ((((((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) < (var_1_5)) ? (((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) : (var_1_5)))) ? (var_1_11 == ((unsigned char) var_1_14)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=1, var_1_10=2147000064, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=2147000064, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=1, var_1_10=2147000064, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 73 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, 73 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred 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.6s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 760/760 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 proved your program to be incorrect! [2025-03-03 22:41:34,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE