./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e03576b009d4d466bb93ae3e10eae3d055a6fdb65b80bf301dc2897b34d3bc27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:31:54,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:31:54,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:31:54,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:31:54,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:31:54,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:31:54,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:31:54,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:31:54,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:31:54,758 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:31:54,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:31:54,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:31:54,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:31:54,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:31:54,760 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:31:54,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:31:54,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:31:54,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:31:54,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:31:54,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:31:54,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:31:54,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:31:54,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:31:54,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:31:54,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:31:54,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:31:54,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:31:54,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:31:54,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:31:54,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:31:54,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:31:54,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:31:54,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:31:54,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:31:54,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:31:54,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:31:54,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:31:54,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:31:54,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:31:54,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:31:54,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:31:54,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:31:54,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:31:54,763 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-jdk21/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 -> e03576b009d4d466bb93ae3e10eae3d055a6fdb65b80bf301dc2897b34d3bc27 [2025-02-06 02:31:54,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:31:54,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:31:54,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:31:54,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:31:54,987 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:31:54,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i [2025-02-06 02:31:56,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d7f0dcd9/ce481e2a088e4173ab729d613c789b61/FLAG37d1ef0ec [2025-02-06 02:31:56,350 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:31:56,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i [2025-02-06 02:31:56,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d7f0dcd9/ce481e2a088e4173ab729d613c789b61/FLAG37d1ef0ec [2025-02-06 02:31:56,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d7f0dcd9/ce481e2a088e4173ab729d613c789b61 [2025-02-06 02:31:56,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:31:56,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:31:56,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:31:56,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:31:56,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:31:56,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b821748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56, skipping insertion in model container [2025-02-06 02:31:56,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:31:56,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i[915,928] [2025-02-06 02:31:56,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:31:56,780 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:31:56,789 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i[915,928] [2025-02-06 02:31:56,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:31:56,810 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:31:56,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56 WrapperNode [2025-02-06 02:31:56,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:31:56,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:31:56,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:31:56,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:31:56,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,841 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-02-06 02:31:56,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:31:56,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:31:56,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:31:56,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:31:56,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,854 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-02-06 02:31:56,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:31:56,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:31:56,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:31:56,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:31:56,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (1/1) ... [2025-02-06 02:31:56,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:31:56,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:31:56,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:31:56,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:31:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:31:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:31:56,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:31:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:31:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:31:56,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:31:56,968 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:31:56,970 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:31:57,114 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:31:57,114 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:31:57,120 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:31:57,120 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:31:57,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:31:57 BoogieIcfgContainer [2025-02-06 02:31:57,120 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:31:57,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:31:57,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:31:57,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:31:57,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:31:56" (1/3) ... [2025-02-06 02:31:57,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f318b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:31:57, skipping insertion in model container [2025-02-06 02:31:57,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:56" (2/3) ... [2025-02-06 02:31:57,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f318b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:31:57, skipping insertion in model container [2025-02-06 02:31:57,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:31:57" (3/3) ... [2025-02-06 02:31:57,126 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-65.i [2025-02-06 02:31:57,135 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:31:57,137 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-65.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:31:57,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:31:57,186 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;@24a5db8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:31:57,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:31:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 02:31:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 02:31:57,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:57,200 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:31:57,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:57,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash -949498675, now seen corresponding path program 1 times [2025-02-06 02:31:57,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:31:57,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712181668] [2025-02-06 02:31:57,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:31:57,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 02:31:57,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 02:31:57,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:57,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 02:31:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:31:57,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712181668] [2025-02-06 02:31:57,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712181668] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:31:57,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120311490] [2025-02-06 02:31:57,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:57,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:31:57,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:31:57,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:31:57,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:31:57,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 02:31:57,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 02:31:57,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:57,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:57,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:31:57,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:31:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 02:31:57,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:31:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120311490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:31:57,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:31:57,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:31:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943450473] [2025-02-06 02:31:57,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:57,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:31:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:31:57,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:31:57,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:31:57,553 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 02:31:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:57,571 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-02-06 02:31:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:31:57,572 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2025-02-06 02:31:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:57,576 INFO L225 Difference]: With dead ends: 100 [2025-02-06 02:31:57,576 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 02:31:57,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-02-06 02:31:57,580 INFO L435 NwaCegarLoop]: 72 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, 72 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-02-06 02:31:57,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:31:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 02:31:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 02:31:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 02:31:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-02-06 02:31:57,604 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 110 [2025-02-06 02:31:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:57,604 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-02-06 02:31:57,604 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 02:31:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-02-06 02:31:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 02:31:57,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:57,607 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:31:57,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:31:57,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:31:57,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:57,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1146428022, now seen corresponding path program 1 times [2025-02-06 02:31:57,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:31:57,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811822453] [2025-02-06 02:31:57,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:31:57,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 02:31:57,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 02:31:57,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:57,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:31:57,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:31:57,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 02:31:57,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 02:31:57,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:57,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:31:58,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:31:58,020 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:31:58,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:31:58,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:31:58,024 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 02:31:58,073 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:31:58,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:31:58 BoogieIcfgContainer [2025-02-06 02:31:58,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:31:58,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:31:58,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:31:58,077 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:31:58,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:31:57" (3/4) ... [2025-02-06 02:31:58,079 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:31:58,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:31:58,080 INFO L158 Benchmark]: Toolchain (without parser) took 1434.74ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 84.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-02-06 02:31:58,080 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:58,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.01ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 92.5MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:31:58,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.95ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:58,081 INFO L158 Benchmark]: Boogie Preprocessor took 22.42ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:58,081 INFO L158 Benchmark]: IcfgBuilder took 255.69ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 73.9MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:31:58,083 INFO L158 Benchmark]: TraceAbstraction took 954.04ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 84.8MB in the end (delta: -11.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:58,083 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 66.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:58,084 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.01ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 92.5MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.95ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.42ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 255.69ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 73.9MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 954.04ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 84.8MB in the end (delta: -11.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 66.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 40, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someUnaryFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 1000000000.1; [L23] float var_1_2 = 256.75; [L24] unsigned char var_1_3 = 1; [L25] float var_1_4 = 8.2; [L26] signed long int var_1_5 = -32; [L27] signed long int var_1_6 = 4; [L28] signed char var_1_7 = 5; [L29] signed char var_1_8 = 64; [L30] signed char var_1_9 = 16; [L31] signed char var_1_10 = 64; [L32] signed char var_1_11 = -64; [L33] double var_1_12 = 15.9; [L34] double var_1_13 = 1.5; [L35] double var_1_14 = 10000000000.375; [L36] unsigned char var_1_15 = 1; VAL [isInitial=0, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_2=1027/4, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L64] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L65] var_1_3 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L67] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L67] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L68] var_1_4 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L69] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=4, var_1_7=5, var_1_8=64, var_1_9=16] [L70] var_1_6 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L71] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L72] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L72] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=16] [L73] var_1_8 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_8 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=16] [L74] RET assume_abort_if_not(var_1_8 >= 63) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=16] [L75] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=16] [L75] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=16] [L76] var_1_9 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L78] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L78] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, var_1_10=64, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L79] var_1_10 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L80] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L81] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L81] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_12=159/10, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L82] var_1_12 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L83] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_13=3/2, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L84] var_1_13 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427387900e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L85] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427387900e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_14=80000000003/8, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L86] var_1_14 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427387900e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L87] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427387900e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L88] var_1_15 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L89] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L90] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L90] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000001/10, var_1_3=1, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L103] RET updateVariables() [L104] CALL step() [L40] COND FALSE !(0.625f > var_1_2) [L45] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=-32, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L47] COND TRUE \read(var_1_3) [L48] var_1_5 = ((10 + var_1_6) - 2) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L50] signed long int stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=0, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=5, var_1_8=63, var_1_9=24] [L51] COND TRUE ((64 - 25) - (var_1_8 - var_1_9)) >= stepLocal_0 [L52] var_1_7 = (((((var_1_9 - 32)) > (var_1_10)) ? ((var_1_9 - 32)) : (var_1_10))) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=-8, var_1_8=63, var_1_9=24] [L54] COND FALSE !((var_1_12 - (var_1_13 + var_1_14)) <= var_1_1) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=-8, var_1_8=63, var_1_9=24] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return ((((0.625f > var_1_2) ? (var_1_3 ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && (var_1_3 ? (var_1_5 == ((signed long int) ((10 + var_1_6) - 2))) : 1)) && ((((64 - 25) - (var_1_8 - var_1_9)) >= var_1_6) ? (var_1_7 == ((signed char) (((((var_1_9 - 32)) > (var_1_10)) ? ((var_1_9 - 32)) : (var_1_10))))) : 1)) && (((var_1_12 - (var_1_13 + var_1_14)) <= var_1_1) ? ((var_1_3 && var_1_15) ? (var_1_11 == ((signed char) var_1_10)) : (var_1_11 == ((signed char) var_1_9))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=-8, var_1_8=63, var_1_9=24] [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=-8, var_1_8=63, var_1_9=24] [L19] reach_error() VAL [isInitial=1, var_1_10=-127, var_1_11=-64, var_1_15=1, var_1_1=10000000005, var_1_3=1, var_1_4=10000000005, var_1_5=8, var_1_6=0, var_1_7=-8, var_1_8=63, var_1_9=24] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 17, 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, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 72 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1056/1088 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-02-06 02:31:58,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e03576b009d4d466bb93ae3e10eae3d055a6fdb65b80bf301dc2897b34d3bc27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:31:59,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:31:59,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:31:59,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:31:59,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:32:00,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:32:00,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:32:00,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:32:00,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:32:00,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:32:00,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:32:00,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:32:00,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:32:00,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:32:00,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:32:00,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:32:00,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:32:00,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:32:00,007 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-jdk21/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 -> e03576b009d4d466bb93ae3e10eae3d055a6fdb65b80bf301dc2897b34d3bc27 [2025-02-06 02:32:00,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:32:00,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:32:00,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:32:00,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:32:00,277 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:32:00,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i [2025-02-06 02:32:01,409 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397c06db9/ff97673640484e1cbb1fad3f3a396b4f/FLAG52f76adfd [2025-02-06 02:32:01,618 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:32:01,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i [2025-02-06 02:32:01,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397c06db9/ff97673640484e1cbb1fad3f3a396b4f/FLAG52f76adfd [2025-02-06 02:32:01,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397c06db9/ff97673640484e1cbb1fad3f3a396b4f [2025-02-06 02:32:01,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:32:01,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:32:01,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:32:01,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:32:01,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:32:01,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:32:01" (1/1) ... [2025-02-06 02:32:01,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac2b6d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:01, skipping insertion in model container [2025-02-06 02:32:01,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:32:01" (1/1) ... [2025-02-06 02:32:02,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:32:02,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i[915,928] [2025-02-06 02:32:02,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:32:02,116 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:32:02,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-65.i[915,928] [2025-02-06 02:32:02,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:32:02,151 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:32:02,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02 WrapperNode [2025-02-06 02:32:02,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:32:02,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:32:02,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:32:02,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:32:02,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,187 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-02-06 02:32:02,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:32:02,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:32:02,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:32:02,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:32:02,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,195 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,208 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-02-06 02:32:02,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:32:02,232 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:32:02,234 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:32:02,234 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:32:02,235 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (1/1) ... [2025-02-06 02:32:02,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:32:02,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:32:02,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:32:02,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:32:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:32:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:32:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:32:02,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:32:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:32:02,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:32:02,350 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:32:02,352 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:32:06,270 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:32:06,270 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:32:06,280 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:32:06,280 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:32:06,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:32:06 BoogieIcfgContainer [2025-02-06 02:32:06,280 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:32:06,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:32:06,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:32:06,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:32:06,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:32:01" (1/3) ... [2025-02-06 02:32:06,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6074a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:32:06, skipping insertion in model container [2025-02-06 02:32:06,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:02" (2/3) ... [2025-02-06 02:32:06,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6074a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:32:06, skipping insertion in model container [2025-02-06 02:32:06,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:32:06" (3/3) ... [2025-02-06 02:32:06,290 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-65.i [2025-02-06 02:32:06,300 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:32:06,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-65.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:32:06,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:32:06,341 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;@797a35ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:32:06,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:32:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 02:32:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 02:32:06,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:32:06,350 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:32:06,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:32:06,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:32:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash -949498675, now seen corresponding path program 1 times [2025-02-06 02:32:06,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:32:06,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947183323] [2025-02-06 02:32:06,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:32:06,365 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-02-06 02:32:06,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:32:06,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 02:32:06,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 02:32:06,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 02:32:06,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 02:32:06,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:32:06,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:32:06,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:32:06,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:32:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-02-06 02:32:06,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:32:06,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:32:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947183323] [2025-02-06 02:32:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947183323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:32:06,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:32:06,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:32:06,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721657066] [2025-02-06 02:32:06,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:32:06,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:32:06,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:32:06,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:32:06,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:32:06,680 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 02:32:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:32:06,694 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-02-06 02:32:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:32:06,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2025-02-06 02:32:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:32:06,699 INFO L225 Difference]: With dead ends: 100 [2025-02-06 02:32:06,699 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 02:32:06,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-02-06 02:32:06,703 INFO L435 NwaCegarLoop]: 72 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, 72 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-02-06 02:32:06,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:32:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 02:32:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 02:32:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 02:32:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-02-06 02:32:06,729 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 110 [2025-02-06 02:32:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:32:06,729 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-02-06 02:32:06,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 02:32:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-02-06 02:32:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 02:32:06,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:32:06,732 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:32:06,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 02:32:06,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 02:32:06,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:32:06,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:32:06,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1146428022, now seen corresponding path program 1 times [2025-02-06 02:32:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:32:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450241052] [2025-02-06 02:32:06,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:32:06,938 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-02-06 02:32:06,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:32:06,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 02:32:06,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 02:32:06,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 02:32:07,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 02:32:07,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:32:07,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:32:07,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 02:32:07,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:32:58,073 WARN L286 SmtUtils]: Spent 11.48s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)