./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:55:33,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:55:33,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:55:33,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:55:33,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:55:33,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:55:33,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:55:33,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:55:33,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:55:33,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:55:33,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:55:33,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:55:33,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:55:33,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:55:33,848 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:55:33,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:55:33,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:55:33,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:55:33,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:55:33,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:55:33,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:55:33,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:55:33,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:55:33,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:55:33,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:55:33,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:55:33,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:55:33,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:55:33,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:55:33,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:55:33,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:33,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:55:33,850 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 [2025-03-04 00:55:34,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:55:34,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:55:34,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:55:34,083 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:55:34,083 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:55:34,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2025-03-04 00:55:35,169 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741c3f4b3/7ba2350619ed45159892078824d67d30/FLAG217a526fe [2025-03-04 00:55:35,497 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:55:35,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2025-03-04 00:55:35,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741c3f4b3/7ba2350619ed45159892078824d67d30/FLAG217a526fe [2025-03-04 00:55:35,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741c3f4b3/7ba2350619ed45159892078824d67d30 [2025-03-04 00:55:35,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:55:35,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:55:35,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:35,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:55:35,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:55:35,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:35,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184b5e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35, skipping insertion in model container [2025-03-04 00:55:35,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:35,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:55:35,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i[913,926] [2025-03-04 00:55:35,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:35,934 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:55:35,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i[913,926] [2025-03-04 00:55:35,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:35,984 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:55:35,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35 WrapperNode [2025-03-04 00:55:35,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:35,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:35,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:55:35,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:55:35,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:35,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,027 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-04 00:55:36,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:36,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:55:36,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:55:36,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:55:36,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,065 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:55:36,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,075 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:55:36,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:55:36,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:55:36,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:55:36,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (1/1) ... [2025-03-04 00:55:36,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:36,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:55:36,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:55:36,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:55:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:55:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:55:36,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:55:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:55:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:55:36,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:55:36,182 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:55:36,183 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:55:36,414 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:55:36,414 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:55:36,425 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:55:36,426 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:55:36,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:36 BoogieIcfgContainer [2025-03-04 00:55:36,426 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:55:36,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:55:36,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:55:36,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:55:36,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:55:35" (1/3) ... [2025-03-04 00:55:36,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62af209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:36, skipping insertion in model container [2025-03-04 00:55:36,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:35" (2/3) ... [2025-03-04 00:55:36,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62af209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:36, skipping insertion in model container [2025-03-04 00:55:36,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:36" (3/3) ... [2025-03-04 00:55:36,435 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-48.i [2025-03-04 00:55:36,446 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:55:36,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-48.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:55:36,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:55:36,509 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;@52b2957d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:55:36,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:55:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:55:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 00:55:36,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:36,523 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:55:36,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:36,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2134092938, now seen corresponding path program 1 times [2025-03-04 00:55:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:55:36,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896560765] [2025-03-04 00:55:36,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:55:36,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 00:55:36,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 00:55:36,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:36,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 00:55:37,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:55:37,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896560765] [2025-03-04 00:55:37,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896560765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:55:37,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:55:37,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:55:37,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267190147] [2025-03-04 00:55:37,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:55:37,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:55:37,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:55:37,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:55:37,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:55:37,071 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 00:55:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:55:37,106 INFO L93 Difference]: Finished difference Result 110 states and 186 transitions. [2025-03-04 00:55:37,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:55:37,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2025-03-04 00:55:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:55:37,113 INFO L225 Difference]: With dead ends: 110 [2025-03-04 00:55:37,114 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 00:55:37,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:55:37,119 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:55:37,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:55:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 00:55:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-04 00:55:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:55:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2025-03-04 00:55:37,149 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 131 [2025-03-04 00:55:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:55:37,150 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2025-03-04 00:55:37,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 00:55:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2025-03-04 00:55:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 00:55:37,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:37,152 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:55:37,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:55:37,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:37,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:37,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2132245207, now seen corresponding path program 1 times [2025-03-04 00:55:37,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:55:37,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562869145] [2025-03-04 00:55:37,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:55:37,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 00:55:37,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 00:55:37,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:37,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:55:37,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:55:37,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 00:55:37,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 00:55:37,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:37,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:55:37,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:55:37,366 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:55:37,367 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:55:37,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:55:37,370 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:55:37,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:55:37,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:55:37 BoogieIcfgContainer [2025-03-04 00:55:37,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:55:37,447 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:55:37,447 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:55:37,447 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:55:37,447 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:36" (3/4) ... [2025-03-04 00:55:37,449 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:55:37,450 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:55:37,450 INFO L158 Benchmark]: Toolchain (without parser) took 1695.27ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 35.8MB in the end (delta: 68.7MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2025-03-04 00:55:37,451 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:37,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.31ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 91.0MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:55:37,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.04ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:37,451 INFO L158 Benchmark]: Boogie Preprocessor took 55.26ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 84.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:37,452 INFO L158 Benchmark]: IcfgBuilder took 341.99ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 66.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:55:37,452 INFO L158 Benchmark]: TraceAbstraction took 1017.43ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 36.1MB in the end (delta: 29.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2025-03-04 00:55:37,453 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 142.6MB. Free memory was 36.1MB in the beginning and 35.8MB in the end (delta: 288.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:37,468 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.31ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 91.0MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.04ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.26ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 84.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 341.99ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 66.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1017.43ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 36.1MB in the end (delta: 29.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 142.6MB. Free memory was 36.1MB in the beginning and 35.8MB in the end (delta: 288.0kB). 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 111, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 32.8; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 5.5; [L25] float var_1_4 = 128.75; [L26] float var_1_5 = 4.5; [L27] float var_1_6 = 9.25; [L28] unsigned char var_1_7 = 5; [L29] unsigned char var_1_11 = 200; [L30] unsigned char var_1_12 = 8; [L31] unsigned char var_1_13 = 4; [L32] unsigned char var_1_14 = 100; [L33] unsigned char var_1_15 = 64; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 200; [L36] unsigned char var_1_18 = 2; [L37] unsigned char var_1_19 = 0; [L38] unsigned long int var_1_20 = 1; [L39] signed long int var_1_21 = 64; [L40] unsigned char var_1_22 = 100; [L41] unsigned char last_1_var_1_7 = 5; VAL [isInitial=0, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_2=10227/40, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L108] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_2=10227/40, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L118] RET updateLastVariables() [L119] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_float() [L73] 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, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L73] 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, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L74] var_1_3 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L75] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L76] var_1_4 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L77] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L78] var_1_5 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=37/4, var_1_7=5] [L79] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=37/4, var_1_7=5] [L80] var_1_6 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L81] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L82] var_1_11 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_11 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L83] RET assume_abort_if_not(var_1_11 >= 190) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L84] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L84] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L87] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L87] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L88] var_1_13 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L90] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L90] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L91] var_1_14 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L92] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L93] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L93] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L95] RET assume_abort_if_not(var_1_15 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L96] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L96] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L97] var_1_17 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_17 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L98] RET assume_abort_if_not(var_1_17 >= 191) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L99] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L99] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L102] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L102] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L103] var_1_19 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L104] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L105] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L105] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L119] RET updateVariables() [L120] CALL step() [L45] COND FALSE !(var_1_2 <= var_1_3) [L52] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=260, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=260, var_1_7=5] [L54] var_1_20 = var_1_14 [L55] var_1_21 = var_1_17 [L56] var_1_22 = 4 [L57] signed long int stepLocal_0 = var_1_21; VAL [isInitial=1, last_1_var_1_7=5, stepLocal_0=191, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L58] COND FALSE !(((var_1_17 - var_1_12) - (8 + var_1_18)) > stepLocal_0) [L61] var_1_16 = var_1_19 VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=0, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L63] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=0, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L120] RET step() [L121] CALL, EXPR property() [L111-L112] return ((((((var_1_2 <= var_1_3) ? ((var_1_3 < ((var_1_4 - var_1_5) + 1.395f)) ? (var_1_1 == ((float) var_1_6)) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (var_1_16 ? ((last_1_var_1_7 != last_1_var_1_7) ? (var_1_7 == ((unsigned char) ((var_1_11 - var_1_12) - var_1_13))) : (var_1_7 == ((unsigned char) (var_1_11 - (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_12))))) : 1)) && ((((var_1_17 - var_1_12) - (8 + var_1_18)) > var_1_21) ? (var_1_16 == ((unsigned char) (! var_1_19))) : (var_1_16 == ((unsigned char) var_1_19)))) && (var_1_20 == ((unsigned long int) var_1_14))) && (var_1_21 == ((signed long int) var_1_17))) && (var_1_22 == ((unsigned char) 4)) ; VAL [\result=0, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=0, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=0, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=0, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=0, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 77 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 3, 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.4s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 840/840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:55:37,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:55:39,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:55:39,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:55:39,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:55:39,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:55:39,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:55:39,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:55:39,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:55:39,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:55:39,354 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:55:39,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:55:39,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:55:39,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:55:39,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:55:39,355 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:55:39,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:55:39,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:55:39,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:55:39,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:55:39,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:55:39,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:55:39,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:55:39,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:55:39,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:55:39,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:39,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:55:39,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:55:39,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:55:39,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:55:39,357 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:55:39,357 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:55:39,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:55:39,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:55:39,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:55:39,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:55:39,358 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 [2025-03-04 00:55:39,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:55:39,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:55:39,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:55:39,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:55:39,618 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:55:39,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2025-03-04 00:55:40,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77260cf1e/7e972e10e53f46fd96ec06aa9eef3985/FLAGaeb23b08a [2025-03-04 00:55:40,972 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:55:40,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2025-03-04 00:55:40,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77260cf1e/7e972e10e53f46fd96ec06aa9eef3985/FLAGaeb23b08a [2025-03-04 00:55:40,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77260cf1e/7e972e10e53f46fd96ec06aa9eef3985 [2025-03-04 00:55:40,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:55:41,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:55:41,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:41,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:55:41,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:55:41,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:40" (1/1) ... [2025-03-04 00:55:41,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61698d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41, skipping insertion in model container [2025-03-04 00:55:41,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:40" (1/1) ... [2025-03-04 00:55:41,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:55:41,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i[913,926] [2025-03-04 00:55:41,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:41,178 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:55:41,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i[913,926] [2025-03-04 00:55:41,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:41,220 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:55:41,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41 WrapperNode [2025-03-04 00:55:41,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:41,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:41,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:55:41,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:55:41,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,260 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-04 00:55:41,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:41,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:55:41,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:55:41,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:55:41,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,289 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:55:41,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:55:41,309 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:55:41,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:55:41,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:55:41,313 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (1/1) ... [2025-03-04 00:55:41,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:41,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:55:41,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:55:41,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:55:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:55:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:55:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:55:41,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:55:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:55:41,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:55:41,432 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:55:41,434 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:55:42,071 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:55:42,073 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:55:42,080 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:55:42,080 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:55:42,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:42 BoogieIcfgContainer [2025-03-04 00:55:42,081 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:55:42,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:55:42,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:55:42,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:55:42,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:55:40" (1/3) ... [2025-03-04 00:55:42,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5b6d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:42, skipping insertion in model container [2025-03-04 00:55:42,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:41" (2/3) ... [2025-03-04 00:55:42,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5b6d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:42, skipping insertion in model container [2025-03-04 00:55:42,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:42" (3/3) ... [2025-03-04 00:55:42,087 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-48.i [2025-03-04 00:55:42,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:55:42,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-48.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:55:42,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:55:42,151 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;@6efd5faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:55:42,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:55:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:55:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 00:55:42,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:42,166 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:55:42,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:42,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2134092938, now seen corresponding path program 1 times [2025-03-04 00:55:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:55:42,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118304715] [2025-03-04 00:55:42,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:42,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:55:42,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:55:42,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:55:42,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:55:42,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 00:55:42,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 00:55:42,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:42,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:42,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 00:55:42,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:55:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-04 00:55:42,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:55:42,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:55:42,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118304715] [2025-03-04 00:55:42,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118304715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:55:42,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:55:42,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:55:42,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828538245] [2025-03-04 00:55:42,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:55:42,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:55:42,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:55:42,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:55:42,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:55:42,608 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 00:55:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:55:43,041 INFO L93 Difference]: Finished difference Result 178 states and 307 transitions. [2025-03-04 00:55:43,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:55:43,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2025-03-04 00:55:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:55:43,054 INFO L225 Difference]: With dead ends: 178 [2025-03-04 00:55:43,054 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 00:55:43,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:55:43,059 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 118 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:55:43,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 179 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:55:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 00:55:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 60. [2025-03-04 00:55:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:55:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2025-03-04 00:55:43,099 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 131 [2025-03-04 00:55:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:55:43,103 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2025-03-04 00:55:43,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 00:55:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2025-03-04 00:55:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 00:55:43,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:43,105 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:55:43,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:55:43,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:55:43,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:43,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2132245207, now seen corresponding path program 1 times [2025-03-04 00:55:43,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:55:43,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727172776] [2025-03-04 00:55:43,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:43,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:55:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:55:43,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:55:43,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:55:43,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 00:55:43,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 00:55:43,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:43,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:43,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 00:55:43,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:55:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 365 proven. 359 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 00:55:48,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:55:51,916 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:55:51,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727172776] [2025-03-04 00:55:51,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727172776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:55:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [11343988] [2025-03-04 00:55:51,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:51,917 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 00:55:51,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 00:55:51,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 00:55:51,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-04 00:55:51,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 00:55:52,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 00:55:52,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:52,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:52,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 00:55:52,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:55:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 634 proven. 87 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-04 00:55:56,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:55:58,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [11343988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:55:58,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:55:58,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 28 [2025-03-04 00:55:58,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602204397] [2025-03-04 00:55:58,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:55:58,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 00:55:58,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:55:58,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 00:55:58,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 00:55:58,201 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 28 states have internal predecessors, (76), 6 states have call successors, (26), 6 states have call predecessors, (26), 12 states have return successors, (27), 7 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-04 00:56:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:01,215 INFO L93 Difference]: Finished difference Result 173 states and 222 transitions. [2025-03-04 00:56:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 00:56:01,217 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 28 states have internal predecessors, (76), 6 states have call successors, (26), 6 states have call predecessors, (26), 12 states have return successors, (27), 7 states have call predecessors, (27), 6 states have call successors, (27) Word has length 131 [2025-03-04 00:56:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:01,218 INFO L225 Difference]: With dead ends: 173 [2025-03-04 00:56:01,218 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 00:56:01,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=839, Invalid=3451, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 00:56:01,223 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 155 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:56:01,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 400 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:56:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 00:56:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 79. [2025-03-04 00:56:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:56:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2025-03-04 00:56:01,240 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 131 [2025-03-04 00:56:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:01,242 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2025-03-04 00:56:01,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 28 states have internal predecessors, (76), 6 states have call successors, (26), 6 states have call predecessors, (26), 12 states have return successors, (27), 7 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-04 00:56:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2025-03-04 00:56:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 00:56:01,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:01,245 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:56:01,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:56:01,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:56:01,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:56:01,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:01,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:01,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1705651070, now seen corresponding path program 1 times [2025-03-04 00:56:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:56:01,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128658476] [2025-03-04 00:56:01,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:01,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:56:01,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:56:01,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:56:01,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 00:56:01,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 00:56:01,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 00:56:01,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:01,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:01,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:56:01,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:56:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 596 proven. 48 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 00:56:01,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:56:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 00:56:02,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:56:02,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128658476] [2025-03-04 00:56:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128658476] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:56:02,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:56:02,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2025-03-04 00:56:02,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630535442] [2025-03-04 00:56:02,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:02,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:56:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:56:02,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:56:02,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:56:02,052 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 00:56:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:02,085 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2025-03-04 00:56:02,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:56:02,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2025-03-04 00:56:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:02,087 INFO L225 Difference]: With dead ends: 148 [2025-03-04 00:56:02,087 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:56:02,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:56:02,088 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:56:02,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:56:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:56:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:56:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 00:56:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:56:02,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2025-03-04 00:56:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:02,089 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:56:02,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 00:56:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:56:02,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:56:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:56:02,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 00:56:02,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:56:02,296 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:56:02,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:56:03,369 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:56:03,377 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:56:03,378 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:56:03,378 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:56:03,378 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:56:03,378 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:56:03,378 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:56:03,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:56:03 BoogieIcfgContainer [2025-03-04 00:56:03,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:56:03,380 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:56:03,380 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:56:03,381 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:56:03,381 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:42" (3/4) ... [2025-03-04 00:56:03,383 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:56:03,386 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:56:03,391 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 00:56:03,392 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:56:03,392 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:56:03,392 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:56:03,447 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:56:03,448 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:56:03,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:56:03,448 INFO L158 Benchmark]: Toolchain (without parser) took 22448.41ms. Allocated memory was 117.4MB in the beginning and 880.8MB in the end (delta: 763.4MB). Free memory was 92.5MB in the beginning and 565.9MB in the end (delta: -473.3MB). Peak memory consumption was 285.2MB. Max. memory is 16.1GB. [2025-03-04 00:56:03,449 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:56:03,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.82ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.0MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:56:03,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.09ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:56:03,449 INFO L158 Benchmark]: Boogie Preprocessor took 47.01ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 75.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:56:03,449 INFO L158 Benchmark]: IcfgBuilder took 772.18ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 58.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:56:03,450 INFO L158 Benchmark]: TraceAbstraction took 21297.30ms. Allocated memory was 117.4MB in the beginning and 880.8MB in the end (delta: 763.4MB). Free memory was 58.0MB in the beginning and 574.2MB in the end (delta: -516.2MB). Peak memory consumption was 251.6MB. Max. memory is 16.1GB. [2025-03-04 00:56:03,450 INFO L158 Benchmark]: Witness Printer took 67.44ms. Allocated memory is still 880.8MB. Free memory was 574.2MB in the beginning and 565.9MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:56:03,451 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.91ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.82ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.0MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.09ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.01ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 75.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 772.18ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 58.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21297.30ms. Allocated memory was 117.4MB in the beginning and 880.8MB in the end (delta: 763.4MB). Free memory was 58.0MB in the beginning and 574.2MB in the end (delta: -516.2MB). Peak memory consumption was 251.6MB. Max. memory is 16.1GB. * Witness Printer took 67.44ms. Allocated memory is still 880.8MB. Free memory was 574.2MB in the beginning and 565.9MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 712 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 523 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 911 IncrementalHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 189 mSDtfsCounter, 911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 719 GetRequests, 627 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 53, 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, 3 MinimizatonAttempts, 100 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 652 ConstructedInterpolants, 0 QuantifiedInterpolants, 7090 SizeOfPredicates, 36 NumberOfNonLiveVariables, 853 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3706/4200 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Location Invariant Derived location invariant: ((((var_1_17 >= 191) && (var_1_18 <= 63)) && (var_1_19 <= 0)) && (var_1_12 <= 63)) RESULT: Ultimate proved your program to be correct! [2025-03-04 00:56:03,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE