./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a020ee64544eeb19eecefb050ee89adc4a4541f59947a83f5e89345ae7ca17df --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:04:06,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:04:06,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:04:06,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:04:06,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:04:06,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:04:06,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:04:06,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:04:06,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:04:06,266 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:04:06,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:04:06,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:04:06,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:04:06,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:04:06,267 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:04:06,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:04:06,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:04:06,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:04:06,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:04:06,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:04:06,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:04:06,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:04:06,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:04:06,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:04:06,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:04:06,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:04:06,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:04:06,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:04:06,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:04:06,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:04:06,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:04:06,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:04:06,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:04:06,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:04:06,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:04:06,270 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:04:06,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:04:06,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:04:06,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:04:06,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:04:06,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:04:06,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:04:06,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:04:06,270 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a020ee64544eeb19eecefb050ee89adc4a4541f59947a83f5e89345ae7ca17df [2025-02-06 03:04:06,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:04:06,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:04:06,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:04:06,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:04:06,502 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:04:06,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i [2025-02-06 03:04:07,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb93068c6/126a463bbb29469fbb4443fb8c907624/FLAG576ec1603 [2025-02-06 03:04:07,916 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:04:07,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i [2025-02-06 03:04:07,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb93068c6/126a463bbb29469fbb4443fb8c907624/FLAG576ec1603 [2025-02-06 03:04:07,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb93068c6/126a463bbb29469fbb4443fb8c907624 [2025-02-06 03:04:07,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:04:07,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:04:07,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:04:07,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:04:07,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:04:07,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:04:07" (1/1) ... [2025-02-06 03:04:07,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473046f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:07, skipping insertion in model container [2025-02-06 03:04:07,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:04:07" (1/1) ... [2025-02-06 03:04:07,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:04:08,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i[913,926] [2025-02-06 03:04:08,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:04:08,127 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:04:08,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i[913,926] [2025-02-06 03:04:08,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:04:08,180 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:04:08,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08 WrapperNode [2025-02-06 03:04:08,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:04:08,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:04:08,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:04:08,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:04:08,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,218 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-02-06 03:04:08,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:04:08,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:04:08,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:04:08,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:04:08,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,240 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 03:04:08,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,246 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:04:08,254 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:04:08,254 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:04:08,254 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:04:08,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (1/1) ... [2025-02-06 03:04:08,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:04:08,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:04:08,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:04:08,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:04:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:04:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:04:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:04:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:04:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:04:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:04:08,371 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:04:08,372 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:04:08,577 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 03:04:08,577 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:04:08,588 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:04:08,588 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:04:08,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:04:08 BoogieIcfgContainer [2025-02-06 03:04:08,589 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:04:08,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:04:08,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:04:08,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:04:08,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:04:07" (1/3) ... [2025-02-06 03:04:08,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dcb50b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:04:08, skipping insertion in model container [2025-02-06 03:04:08,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:08" (2/3) ... [2025-02-06 03:04:08,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dcb50b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:04:08, skipping insertion in model container [2025-02-06 03:04:08,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:04:08" (3/3) ... [2025-02-06 03:04:08,596 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-45.i [2025-02-06 03:04:08,606 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:04:08,607 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-45.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:04:08,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:04:08,656 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;@5d8c3401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:04:08,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:04:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:04:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:04:08,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:04:08,671 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:04:08,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:04:08,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:04:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash -233791709, now seen corresponding path program 1 times [2025-02-06 03:04:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:04:08,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297042502] [2025-02-06 03:04:08,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:04:08,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:04:08,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:04:08,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:04:08,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:08,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:04:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-02-06 03:04:08,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:04:08,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297042502] [2025-02-06 03:04:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297042502] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:04:08,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773913864] [2025-02-06 03:04:08,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:04:08,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:04:08,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:04:08,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:04:08,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:04:08,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:04:09,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:04:09,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:09,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:04:09,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:04:09,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:04:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-02-06 03:04:09,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:04:09,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773913864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:04:09,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:04:09,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:04:09,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482909003] [2025-02-06 03:04:09,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:04:09,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:04:09,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:04:09,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:04:09,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:04:09,125 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:04:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:04:09,144 INFO L93 Difference]: Finished difference Result 118 states and 206 transitions. [2025-02-06 03:04:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:04:09,146 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 152 [2025-02-06 03:04:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:04:09,150 INFO L225 Difference]: With dead ends: 118 [2025-02-06 03:04:09,150 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 03:04:09,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:04:09,154 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:04:09,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:04:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 03:04:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 03:04:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:04:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2025-02-06 03:04:09,183 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 152 [2025-02-06 03:04:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:04:09,183 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2025-02-06 03:04:09,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:04:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2025-02-06 03:04:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:04:09,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:04:09,186 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:04:09,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:04:09,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:04:09,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:04:09,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:04:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1602633565, now seen corresponding path program 1 times [2025-02-06 03:04:09,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:04:09,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141648487] [2025-02-06 03:04:09,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:04:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:04:09,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:04:09,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:04:09,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:09,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:04:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 69 proven. 69 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-02-06 03:04:10,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:04:10,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141648487] [2025-02-06 03:04:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141648487] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:04:10,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464513033] [2025-02-06 03:04:10,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:04:10,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:04:10,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:04:10,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:04:10,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:04:10,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:04:10,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:04:10,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:10,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:04:10,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:04:10,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:04:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 679 proven. 69 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2025-02-06 03:04:10,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:04:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 69 proven. 72 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-02-06 03:04:11,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464513033] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:04:11,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:04:11,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-02-06 03:04:11,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205118014] [2025-02-06 03:04:11,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:04:11,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:04:11,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:04:11,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:04:11,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:04:11,215 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2025-02-06 03:04:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:04:12,160 INFO L93 Difference]: Finished difference Result 268 states and 373 transitions. [2025-02-06 03:04:12,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 03:04:12,161 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 153 [2025-02-06 03:04:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:04:12,163 INFO L225 Difference]: With dead ends: 268 [2025-02-06 03:04:12,164 INFO L226 Difference]: Without dead ends: 212 [2025-02-06 03:04:12,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 03:04:12,166 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 166 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:04:12,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 442 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:04:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-06 03:04:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 68. [2025-02-06 03:04:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:04:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2025-02-06 03:04:12,187 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 153 [2025-02-06 03:04:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:04:12,188 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2025-02-06 03:04:12,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2025-02-06 03:04:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2025-02-06 03:04:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:04:12,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:04:12,190 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:04:12,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:04:12,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:04:12,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:04:12,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:04:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1603557086, now seen corresponding path program 1 times [2025-02-06 03:04:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:04:12,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868864367] [2025-02-06 03:04:12,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:04:12,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:04:12,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:04:12,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:04:12,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:12,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:04:12,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625023798] [2025-02-06 03:04:12,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:04:12,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:04:12,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:04:12,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:04:12,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:04:12,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:04:12,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:04:12,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:12,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:04:12,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:04:12,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:04:12,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:04:12,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:12,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:04:12,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:04:12,665 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:04:12,666 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:04:12,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:04:12,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:04:12,871 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 03:04:12,954 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:04:12,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:04:12 BoogieIcfgContainer [2025-02-06 03:04:12,957 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:04:12,959 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:04:12,959 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:04:12,959 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:04:12,959 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:04:08" (3/4) ... [2025-02-06 03:04:12,961 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:04:12,962 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:04:12,962 INFO L158 Benchmark]: Toolchain (without parser) took 5026.60ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.8MB in the beginning and 137.8MB in the end (delta: -32.0MB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. [2025-02-06 03:04:12,963 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:04:12,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.69ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 92.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:04:12,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.22ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.6MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:04:12,965 INFO L158 Benchmark]: Boogie Preprocessor took 35.07ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:04:12,965 INFO L158 Benchmark]: IcfgBuilder took 334.57ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 68.2MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:04:12,965 INFO L158 Benchmark]: TraceAbstraction took 4366.32ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 67.4MB in the beginning and 137.8MB in the end (delta: -70.5MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2025-02-06 03:04:12,966 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 318.8MB. Free memory was 137.8MB in the beginning and 137.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:04:12,967 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.69ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 92.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.22ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.6MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.07ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 334.57ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 68.2MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4366.32ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 67.4MB in the beginning and 137.8MB in the end (delta: -70.5MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 318.8MB. Free memory was 137.8MB in the beginning and 137.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 999999.2; [L23] unsigned short int var_1_2 = 5; [L24] signed long int var_1_4 = -2; [L25] double var_1_6 = 0.0; [L26] double var_1_7 = 5.9; [L27] double var_1_8 = 255.6; [L28] float var_1_9 = 25.5; [L29] unsigned char var_1_10 = 0; [L30] float var_1_11 = 0.0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 0; [L34] unsigned char var_1_15 = 0; [L35] unsigned char var_1_16 = 1; [L36] unsigned char var_1_17 = 1; [L37] unsigned char var_1_18 = 64; [L38] signed char var_1_19 = -10; [L39] unsigned char var_1_20 = 5; [L40] unsigned char last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_2=5, var_1_4=-2, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L105] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_2=5, var_1_4=-2, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L66] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L66] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L67] var_1_4 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L68] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L69] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L69] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L70] var_1_6 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && 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_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L71] RET assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && 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_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_7=59/10, var_1_8=1278/5, var_1_9=51/2] [L72] var_1_7 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_8=1278/5, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_8=1278/5, var_1_9=51/2] [L73] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_8=1278/5, var_1_9=51/2] [L74] var_1_8 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L75] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L76] var_1_10 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L77] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L78] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L78] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L79] var_1_11 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L80] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L81] var_1_13 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L82] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L83] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L83] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L84] var_1_14 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L85] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L86] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L86] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L87] var_1_15 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L88] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L89] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L89] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L91] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L92] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L92] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L93] var_1_17 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L94] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L95] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L95] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L96] var_1_19 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L97] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L98] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L98] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L99] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L99] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=5, var_1_4=131, var_1_9=51/2] [L100] var_1_20 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_4=131, var_1_9=51/2] [L101] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_4=131, var_1_9=51/2] [L102] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=31, var_1_4=131, var_1_9=51/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=31, var_1_4=131, var_1_9=51/2] [L102] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=4999996/5, var_1_20=31, var_1_4=131, var_1_9=51/2] [L116] RET updateVariables() [L117] CALL step() [L44] COND TRUE ((var_1_2 + var_1_4) / var_1_19) != last_1_var_1_18 [L45] var_1_18 = var_1_20 VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_1=4999996/5, var_1_20=31, var_1_2=0, var_1_4=131, var_1_9=51/2] [L47] COND TRUE (var_1_18 / 32) < (((((var_1_18 + var_1_18)) < (var_1_18)) ? ((var_1_18 + var_1_18)) : (var_1_18))) [L48] var_1_1 = ((var_1_6 - var_1_7) - var_1_8) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_20=31, var_1_2=0, var_1_4=131, var_1_9=51/2] [L52] COND TRUE var_1_18 == var_1_18 VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_20=31, var_1_2=0, var_1_4=131, var_1_9=51/2] [L53] COND TRUE \read(var_1_10) [L54] var_1_12 = (var_1_13 || var_1_14) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_20=31, var_1_2=0, var_1_4=131, var_1_9=51/2] [L59] COND FALSE !(\read(var_1_12)) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_20=31, var_1_2=0, var_1_4=131, var_1_9=51/2] [L117] RET step() [L118] CALL, EXPR property() [L108-L109] return (((((var_1_18 / 32) < (((((var_1_18 + var_1_18)) < (var_1_18)) ? ((var_1_18 + var_1_18)) : (var_1_18)))) ? (var_1_1 == ((double) ((var_1_6 - var_1_7) - var_1_8))) : (var_1_1 == ((double) (var_1_8 - var_1_7)))) && (var_1_12 ? (var_1_9 == ((float) (((((var_1_8) < (var_1_6)) ? (var_1_8) : (var_1_6))) - (var_1_11 - 0.8f)))) : 1)) && ((var_1_18 == var_1_18) ? (var_1_10 ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) (((var_1_8 >= var_1_1) || var_1_15) && ((var_1_13 || var_1_16) && var_1_17))))) : 1)) && ((((var_1_2 + var_1_4) / var_1_19) != last_1_var_1_18) ? (var_1_18 == ((unsigned char) var_1_20)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_20=31, var_1_2=0, var_1_4=131, var_1_9=51/2] [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_20=31, var_1_2=0, var_1_4=131, var_1_9=51/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, var_1_10=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_20=31, var_1_2=0, var_1_4=131, var_1_9=51/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 3, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 529 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 663 IncrementalHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 190 mSDtfsCounter, 663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 455 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=2, InterpolantAutomatonStates: 43, 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, 2 MinimizatonAttempts, 144 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 916 NumberOfCodeBlocks, 916 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 758 ConstructedInterpolants, 0 QuantifiedInterpolants, 2031 SizeOfPredicates, 4 NumberOfNonLiveVariables, 657 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 5742/6000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:04:12,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a020ee64544eeb19eecefb050ee89adc4a4541f59947a83f5e89345ae7ca17df --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:04:14,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:04:14,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:04:14,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:04:14,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:04:14,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:04:14,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:04:14,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:04:14,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:04:14,964 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:04:14,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:04:14,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:04:14,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:04:14,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:04:14,966 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:04:14,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:04:14,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:04:14,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:04:14,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:04:14,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:04:14,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:04:14,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:04:14,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:04:14,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:04:14,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:04:14,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:04:14,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:04:14,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:04:14,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:04:14,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:04:14,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:04:14,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:04:14,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:04:14,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:04:14,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:04:14,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:04:14,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:04:14,969 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:04:14,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:04:14,969 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:04:14,969 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:04:14,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:04:14,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:04:14,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:04:14,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:04:14,969 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a020ee64544eeb19eecefb050ee89adc4a4541f59947a83f5e89345ae7ca17df [2025-02-06 03:04:15,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:04:15,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:04:15,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:04:15,247 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:04:15,247 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:04:15,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i [2025-02-06 03:04:16,444 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8047191be/f7c826e0526140cab5961a11b336da5d/FLAG509c6e123 [2025-02-06 03:04:16,621 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:04:16,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i [2025-02-06 03:04:16,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8047191be/f7c826e0526140cab5961a11b336da5d/FLAG509c6e123 [2025-02-06 03:04:16,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8047191be/f7c826e0526140cab5961a11b336da5d [2025-02-06 03:04:16,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:04:16,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:04:16,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:04:16,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:04:16,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:04:16,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2166873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16, skipping insertion in model container [2025-02-06 03:04:16,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:04:16,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i[913,926] [2025-02-06 03:04:16,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:04:16,833 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:04:16,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-45.i[913,926] [2025-02-06 03:04:16,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:04:16,881 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:04:16,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16 WrapperNode [2025-02-06 03:04:16,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:04:16,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:04:16,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:04:16,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:04:16,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,915 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-02-06 03:04:16,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:04:16,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:04:16,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:04:16,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:04:16,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,938 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 03:04:16,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:04:16,953 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:04:16,953 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:04:16,953 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:04:16,958 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (1/1) ... [2025-02-06 03:04:16,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:04:16,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:04:16,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:04:16,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:04:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:04:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:04:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:04:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:04:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:04:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:04:17,075 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:04:17,076 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:04:26,877 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 03:04:26,877 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:04:26,884 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:04:26,884 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:04:26,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:04:26 BoogieIcfgContainer [2025-02-06 03:04:26,885 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:04:26,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:04:26,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:04:26,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:04:26,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:04:16" (1/3) ... [2025-02-06 03:04:26,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc060d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:04:26, skipping insertion in model container [2025-02-06 03:04:26,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:04:16" (2/3) ... [2025-02-06 03:04:26,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc060d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:04:26, skipping insertion in model container [2025-02-06 03:04:26,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:04:26" (3/3) ... [2025-02-06 03:04:26,891 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-45.i [2025-02-06 03:04:26,901 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:04:26,902 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-45.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:04:26,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:04:26,958 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;@6da66be1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:04:26,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:04:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:04:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:04:26,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:04:26,972 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:04:26,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:04:26,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:04:26,978 INFO L85 PathProgramCache]: Analyzing trace with hash -233791709, now seen corresponding path program 1 times [2025-02-06 03:04:26,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:04:26,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129094786] [2025-02-06 03:04:26,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:04:26,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:04:26,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:04:26,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:04:26,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:04:27,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:04:27,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:04:27,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:27,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:04:27,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:04:27,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:04:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2025-02-06 03:04:27,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:04:27,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:04:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129094786] [2025-02-06 03:04:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129094786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:04:27,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:04:27,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:04:27,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810469448] [2025-02-06 03:04:27,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:04:27,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:04:27,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:04:27,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:04:27,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:04:27,459 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:04:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:04:27,482 INFO L93 Difference]: Finished difference Result 118 states and 206 transitions. [2025-02-06 03:04:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:04:27,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 152 [2025-02-06 03:04:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:04:27,488 INFO L225 Difference]: With dead ends: 118 [2025-02-06 03:04:27,488 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 03:04:27,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:04:27,493 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:04:27,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:04:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 03:04:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 03:04:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:04:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2025-02-06 03:04:27,521 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 152 [2025-02-06 03:04:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:04:27,522 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2025-02-06 03:04:27,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:04:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2025-02-06 03:04:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:04:27,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:04:27,524 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:04:27,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:04:27,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:04:27,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:04:27,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:04:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1602633565, now seen corresponding path program 1 times [2025-02-06 03:04:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:04:27,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100331786] [2025-02-06 03:04:27,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:04:27,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:04:27,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:04:27,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:04:27,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:04:27,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:04:28,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:04:28,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:28,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:04:28,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:04:28,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:04:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 679 proven. 69 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2025-02-06 03:04:30,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:04:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 69 proven. 72 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-02-06 03:04:31,648 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:04:31,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100331786] [2025-02-06 03:04:31,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100331786] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:04:31,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:04:31,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-02-06 03:04:31,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458172987] [2025-02-06 03:04:31,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:04:31,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:04:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:04:31,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:04:31,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:04:31,653 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-02-06 03:04:36,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:04:40,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:04:44,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:04:48,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:04:52,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:04:56,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:05:00,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:05:01,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:05:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:05:03,569 INFO L93 Difference]: Finished difference Result 199 states and 279 transitions. [2025-02-06 03:05:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 03:05:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 153 [2025-02-06 03:05:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:05:03,572 INFO L225 Difference]: With dead ends: 199 [2025-02-06 03:05:03,572 INFO L226 Difference]: Without dead ends: 143 [2025-02-06 03:05:03,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:05:03,574 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 113 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 99 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:05:03,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 309 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 426 Invalid, 6 Unknown, 0 Unchecked, 30.8s Time] [2025-02-06 03:05:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-06 03:05:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 68. [2025-02-06 03:05:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:05:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2025-02-06 03:05:03,587 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 153 [2025-02-06 03:05:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:05:03,587 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2025-02-06 03:05:03,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-02-06 03:05:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2025-02-06 03:05:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:05:03,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:05:03,592 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:05:03,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:05:03,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:05:03,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:05:03,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:05:03,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1603557086, now seen corresponding path program 1 times [2025-02-06 03:05:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:05:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453218181] [2025-02-06 03:05:03,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:05:03,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:05:03,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:05:03,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:05:03,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:05:03,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:05:04,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:05:04,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:05:04,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:05:04,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:05:04,156 INFO L279 TraceCheckSpWp]: Computing forward predicates...