./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.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 e96454a975ce1a938377bc7f74cac4eca41d61506722199ed63b4e6ea50e6c11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:19:18,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:19:18,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:19:18,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:19:18,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:19:18,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:19:18,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:19:18,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:19:18,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:19:18,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:19:18,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:19:18,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:19:18,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:19:18,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:19:18,451 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:19:18,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:19:18,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:19:18,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:19:18,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:19:18,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:19:18,453 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 -> e96454a975ce1a938377bc7f74cac4eca41d61506722199ed63b4e6ea50e6c11 [2025-03-08 14:19:18,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:19:18,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:19:18,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:19:18,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:19:18,668 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:19:18,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.i [2025-03-08 14:19:19,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22074f8c4/c7dac718891b4226b416c66b00315e6b/FLAGb35b7fd3c [2025-03-08 14:19:20,018 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:19:20,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.i [2025-03-08 14:19:20,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22074f8c4/c7dac718891b4226b416c66b00315e6b/FLAGb35b7fd3c [2025-03-08 14:19:20,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22074f8c4/c7dac718891b4226b416c66b00315e6b [2025-03-08 14:19:20,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:19:20,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:19:20,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:19:20,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:19:20,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:19:20,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d15c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20, skipping insertion in model container [2025-03-08 14:19:20,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:19:20,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.i[915,928] [2025-03-08 14:19:20,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:19:20,523 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:19:20,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.i[915,928] [2025-03-08 14:19:20,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:19:20,565 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:19:20,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20 WrapperNode [2025-03-08 14:19:20,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:19:20,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:19:20,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:19:20,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:19:20,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,587 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-08 14:19:20,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:19:20,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:19:20,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:19:20,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:19:20,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,601 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:19:20,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:19:20,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:19:20,608 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:19:20,608 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:19:20,608 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (1/1) ... [2025-03-08 14:19:20,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:19:20,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:19:20,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:19:20,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:19:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:19:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:19:20,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:19:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:19:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:19:20,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:19:20,702 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:19:20,703 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:19:20,851 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L87: havoc property_#t~bitwise15#1;havoc property_#t~short16#1; [2025-03-08 14:19:20,871 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 14:19:20,871 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:19:20,881 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:19:20,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:19:20,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:19:20 BoogieIcfgContainer [2025-03-08 14:19:20,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:19:20,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:19:20,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:19:20,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:19:20,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:19:20" (1/3) ... [2025-03-08 14:19:20,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773282d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:19:20, skipping insertion in model container [2025-03-08 14:19:20,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:20" (2/3) ... [2025-03-08 14:19:20,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773282d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:19:20, skipping insertion in model container [2025-03-08 14:19:20,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:19:20" (3/3) ... [2025-03-08 14:19:20,889 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-28.i [2025-03-08 14:19:20,898 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:19:20,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-28.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:19:20,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:19:20,947 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;@468e9be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:19:20,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:19:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:19:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 14:19:20,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:19:20,958 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:19:20,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:19:20,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:19:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1046248809, now seen corresponding path program 1 times [2025-03-08 14:19:20,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:19:20,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59538090] [2025-03-08 14:19:20,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:19:20,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:19:21,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 14:19:21,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 14:19:21,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:19:21,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:19:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 14:19:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:19:21,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59538090] [2025-03-08 14:19:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59538090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:19:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536476849] [2025-03-08 14:19:21,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:19:21,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:19:21,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:19:21,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:19:21,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:19:21,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 14:19:21,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 14:19:21,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:19:21,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:19:21,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:19:21,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:19:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 14:19:21,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:19:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536476849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:19:21,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:19:21,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:19:21,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095104821] [2025-03-08 14:19:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:19:21,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:19:21,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:19:21,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:19:21,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:19:21,321 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:19:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:19:21,343 INFO L93 Difference]: Finished difference Result 111 states and 177 transitions. [2025-03-08 14:19:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:19:21,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-03-08 14:19:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:19:21,350 INFO L225 Difference]: With dead ends: 111 [2025-03-08 14:19:21,350 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 14:19:21,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:19:21,354 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:19:21,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:19:21,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 14:19:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 14:19:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:19:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 75 transitions. [2025-03-08 14:19:21,378 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 75 transitions. Word has length 106 [2025-03-08 14:19:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:19:21,379 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 75 transitions. [2025-03-08 14:19:21,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:19:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 75 transitions. [2025-03-08 14:19:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 14:19:21,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:19:21,385 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:19:21,396 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-08 14:19:21,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:19:21,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:19:21,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:19:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash 540227113, now seen corresponding path program 1 times [2025-03-08 14:19:21,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:19:21,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052619957] [2025-03-08 14:19:21,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:19:21,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:19:21,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 14:19:21,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 14:19:21,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:19:21,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:19:21,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:19:21,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 14:19:21,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 14:19:21,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:19:21,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:19:21,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:19:21,809 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:19:21,810 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:19:21,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:19:21,813 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:19:21,867 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:19:21,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:19:21 BoogieIcfgContainer [2025-03-08 14:19:21,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:19:21,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:19:21,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:19:21,871 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:19:21,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:19:20" (3/4) ... [2025-03-08 14:19:21,873 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:19:21,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:19:21,874 INFO L158 Benchmark]: Toolchain (without parser) took 1513.60ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 82.4MB in the end (delta: 23.4MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2025-03-08 14:19:21,874 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:19:21,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.79ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:19:21,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.66ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:19:21,875 INFO L158 Benchmark]: Boogie Preprocessor took 19.39ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 90.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:19:21,875 INFO L158 Benchmark]: IcfgBuilder took 274.36ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 72.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:19:21,876 INFO L158 Benchmark]: TraceAbstraction took 987.28ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 82.4MB in the end (delta: -10.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:19:21,876 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 82.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:19:21,877 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.55ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.79ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.66ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.39ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 90.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 274.36ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 72.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 987.28ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 82.4MB in the end (delta: -10.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 82.4MB 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 someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 50, overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someBinaryFLOATComparisonOperation at line 41, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] float var_1_2 = 63.75; [L24] float var_1_3 = 255.75; [L25] signed char var_1_5 = 10; [L26] signed char var_1_6 = 4; [L27] signed char var_1_7 = -10; [L28] float var_1_8 = 4.75; [L29] float var_1_9 = 99.5; [L30] float var_1_10 = 255.9; [L31] float var_1_11 = 24.85; [L32] signed long int var_1_12 = -2; [L33] signed long int var_1_13 = 1629954775; [L34] signed long int var_1_14 = 1; [L35] signed long int var_1_15 = 1928642731; VAL [isInitial=0, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_2=255/4, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L91] isInitial = 1 [L92] FCALL initially() [L93] int k_loop; [L94] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_2=255/4, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L94] COND TRUE k_loop < 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L57] var_1_2 = __VERIFIER_nondet_float() [L58] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L58] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L59] var_1_3 = __VERIFIER_nondet_float() [L60] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L60] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L61] var_1_5 = __VERIFIER_nondet_char() [L62] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L62] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L63] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L63] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L64] var_1_6 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L66] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L66] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L67] var_1_7 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4, var_1_9=199/2] [L68] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4, var_1_9=199/2] [L69] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4, var_1_9=199/2] [L69] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4, var_1_9=199/2] [L70] var_1_9 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L71] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L72] var_1_10 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L73] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L74] var_1_13 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_13 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L75] RET assume_abort_if_not(var_1_13 >= 1073741822) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L76] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L76] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L77] var_1_14 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L78] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L79] CALL assume_abort_if_not(var_1_14 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L79] RET assume_abort_if_not(var_1_14 <= 1073741823) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L80] var_1_15 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L81] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L82] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L82] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L96] RET updateVariables() [L97] CALL step() [L39] signed long int stepLocal_0 = -4; VAL [isInitial=1, stepLocal_0=-4, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=19/4] [L40] COND TRUE stepLocal_0 < var_1_6 [L41] var_1_8 = ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, var_1_10=2147483651, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=2147483651, var_1_9=2147483651] [L43] var_1_11 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) [L44] signed long int stepLocal_1 = (((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)); VAL [isInitial=1, stepLocal_1=126, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=2147483651, var_1_9=2147483651] [L45] EXPR var_1_6 | 5 VAL [isInitial=1, stepLocal_1=126, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=2147483651, var_1_9=2147483651] [L45] COND TRUE (var_1_6 | 5) <= stepLocal_1 [L46] var_1_12 = (((((var_1_6) < ((var_1_13 - var_1_14))) ? (var_1_6) : ((var_1_13 - var_1_14)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2147483520, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=2147483651, var_1_9=2147483651] [L50] COND TRUE (var_1_2 - var_1_3) <= (- var_1_11) [L51] var_1_1 = (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2147483520, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=125, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=2147483651, var_1_9=2147483651] [L97] RET step() [L98] CALL, EXPR property() [L87] EXPR (((((var_1_2 - var_1_3) <= (- var_1_11)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_14))) ? (var_1_6) : ((var_1_13 - var_1_14)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) 4))) VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2147483520, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=125, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=2147483651, var_1_9=2147483651] [L87-L88] return (((((var_1_2 - var_1_3) <= (- var_1_11)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_14))) ? (var_1_6) : ((var_1_13 - var_1_14)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) 4))) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2147483520, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=125, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=2147483651, var_1_9=2147483651] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2147483520, var_1_13=1073741822, var_1_14=1073741822, var_1_15=2147483646, var_1_1=125, var_1_5=126, var_1_6=0, var_1_7=125, var_1_8=2147483651, var_1_9=2147483651] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 98 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 16, 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, 76 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 76 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 930/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:19:21,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.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 e96454a975ce1a938377bc7f74cac4eca41d61506722199ed63b4e6ea50e6c11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:19:23,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:19:23,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:19:23,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:19:23,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:19:23,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:19:23,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:19:23,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:19:23,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:19:23,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:19:23,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:19:23,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:19:23,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:19:23,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:19:23,763 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:19:23,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:19:23,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:19:23,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:19:23,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:19:23,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:19:23,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:19:23,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:19:23,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:19:23,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:19:23,765 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:19:23,765 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:19:23,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:19:23,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:19:23,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:19:23,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:19:23,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:19:23,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:19:23,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:19:23,766 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 -> e96454a975ce1a938377bc7f74cac4eca41d61506722199ed63b4e6ea50e6c11 [2025-03-08 14:19:24,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:19:24,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:19:24,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:19:24,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:19:24,009 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:19:24,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.i [2025-03-08 14:19:25,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ee78681/c9ea14a3026541b39445ccfc89ebf688/FLAG74e972bb7 [2025-03-08 14:19:25,358 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:19:25,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.i [2025-03-08 14:19:25,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ee78681/c9ea14a3026541b39445ccfc89ebf688/FLAG74e972bb7 [2025-03-08 14:19:25,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ee78681/c9ea14a3026541b39445ccfc89ebf688 [2025-03-08 14:19:25,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:19:25,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:19:25,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:19:25,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:19:25,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:19:25,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:25,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d45283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25, skipping insertion in model container [2025-03-08 14:19:25,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:25,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:19:25,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.i[915,928] [2025-03-08 14:19:25,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:19:25,908 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:19:25,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-28.i[915,928] [2025-03-08 14:19:25,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:19:25,946 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:19:25,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25 WrapperNode [2025-03-08 14:19:25,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:19:25,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:19:25,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:19:25,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:19:25,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:25,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:25,990 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-08 14:19:25,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:19:25,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:19:25,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:19:25,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:19:26,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:26,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:26,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:26,019 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:19:26,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:26,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:26,031 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:26,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:26,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:26,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:26,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:19:26,043 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:19:26,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:19:26,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:19:26,049 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (1/1) ... [2025-03-08 14:19:26,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:19:26,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:19:26,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:19:26,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:19:26,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:19:26,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:19:26,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:19:26,103 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:19:26,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:19:26,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:19:26,160 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:19:26,161 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:19:26,466 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:19:26,466 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:19:26,475 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:19:26,475 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:19:26,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:19:26 BoogieIcfgContainer [2025-03-08 14:19:26,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:19:26,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:19:26,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:19:26,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:19:26,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:19:25" (1/3) ... [2025-03-08 14:19:26,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f89a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:19:26, skipping insertion in model container [2025-03-08 14:19:26,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:25" (2/3) ... [2025-03-08 14:19:26,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f89a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:19:26, skipping insertion in model container [2025-03-08 14:19:26,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:19:26" (3/3) ... [2025-03-08 14:19:26,484 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-28.i [2025-03-08 14:19:26,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:19:26,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-28.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:19:26,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:19:26,537 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;@7dd2b7e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:19:26,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:19:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:19:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:19:26,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:19:26,547 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:19:26,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:19:26,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:19:26,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2016894219, now seen corresponding path program 1 times [2025-03-08 14:19:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:19:26,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068743558] [2025-03-08 14:19:26,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:19:26,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:19:26,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:19:26,561 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:19:26,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:19:26,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:19:26,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:19:26,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:19:26,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:19:26,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:19:26,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:19:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-08 14:19:26,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:19:26,762 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:19:26,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068743558] [2025-03-08 14:19:26,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068743558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:19:26,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:19:26,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:19:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610587314] [2025-03-08 14:19:26,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:19:26,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:19:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:19:26,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:19:26,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:19:26,782 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:19:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:19:26,795 INFO L93 Difference]: Finished difference Result 93 states and 149 transitions. [2025-03-08 14:19:26,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:19:26,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-08 14:19:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:19:26,800 INFO L225 Difference]: With dead ends: 93 [2025-03-08 14:19:26,800 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 14:19:26,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:19:26,803 INFO L435 NwaCegarLoop]: 66 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, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:19:26,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:19:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 14:19:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-08 14:19:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:19:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2025-03-08 14:19:26,844 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 103 [2025-03-08 14:19:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:19:26,845 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2025-03-08 14:19:26,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:19:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2025-03-08 14:19:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:19:26,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:19:26,848 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:19:26,855 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-08 14:19:27,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:19:27,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:19:27,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:19:27,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2074435019, now seen corresponding path program 1 times [2025-03-08 14:19:27,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:19:27,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134536225] [2025-03-08 14:19:27,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:19:27,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:19:27,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:19:27,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:19:27,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:19:27,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:19:27,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:19:27,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:19:27,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:19:27,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 14:19:27,217 INFO L279 TraceCheckSpWp]: Computing forward predicates...