./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.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_codestructure_steplocals_file-93.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 bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:54:20,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:54:20,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:54:20,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:54:20,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:54:20,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:54:20,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:54:20,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:54:20,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:54:20,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:54:20,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:54:20,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:54:20,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:54:20,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:54:20,967 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:54:20,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:54:20,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:54:20,968 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:54:20,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:54:20,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:54:20,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:54:20,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:54:20,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:54:20,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:54:20,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:54:20,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:54:20,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:54:20,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:54:20,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:54:20,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 -> bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd [2025-02-05 20:54:21,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:54:21,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:54:21,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:54:21,226 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:54:21,227 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:54:21,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-02-05 20:54:22,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfe6712eb/f8784b4a5e484a2ba9d2131b8688dba8/FLAGa4d08f5fa [2025-02-05 20:54:22,666 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:54:22,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-02-05 20:54:22,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfe6712eb/f8784b4a5e484a2ba9d2131b8688dba8/FLAGa4d08f5fa [2025-02-05 20:54:22,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfe6712eb/f8784b4a5e484a2ba9d2131b8688dba8 [2025-02-05 20:54:22,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:54:22,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:54:22,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:54:22,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:54:22,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:54:22,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:54:22" (1/1) ... [2025-02-05 20:54:22,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788099dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:22, skipping insertion in model container [2025-02-05 20:54:22,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:54:22" (1/1) ... [2025-02-05 20:54:23,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:54:23,105 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_codestructure_steplocals_file-93.i[917,930] [2025-02-05 20:54:23,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:54:23,156 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:54:23,164 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_codestructure_steplocals_file-93.i[917,930] [2025-02-05 20:54:23,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:54:23,192 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:54:23,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23 WrapperNode [2025-02-05 20:54:23,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:54:23,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:54:23,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:54:23,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:54:23,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,224 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-02-05 20:54:23,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:54:23,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:54:23,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:54:23,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:54:23,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,250 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-05 20:54:23,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:54:23,265 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:54:23,265 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:54:23,265 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:54:23,265 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (1/1) ... [2025-02-05 20:54:23,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:54:23,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:54:23,291 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-05 20:54:23,294 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-05 20:54:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:54:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:54:23,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:54:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:54:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:54:23,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:54:23,380 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:54:23,382 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:54:23,642 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 20:54:23,642 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:54:23,652 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:54:23,652 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:54:23,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:54:23 BoogieIcfgContainer [2025-02-05 20:54:23,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:54:23,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:54:23,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:54:23,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:54:23,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:54:22" (1/3) ... [2025-02-05 20:54:23,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bdf686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:54:23, skipping insertion in model container [2025-02-05 20:54:23,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:23" (2/3) ... [2025-02-05 20:54:23,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bdf686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:54:23, skipping insertion in model container [2025-02-05 20:54:23,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:54:23" (3/3) ... [2025-02-05 20:54:23,661 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-93.i [2025-02-05 20:54:23,672 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:54:23,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-93.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:54:23,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:54:23,721 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;@58ab824a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:54:23,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:54:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:54:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:54:23,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:54:23,738 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:54:23,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:54:23,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:54:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1863272572, now seen corresponding path program 1 times [2025-02-05 20:54:23,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:54:23,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628744231] [2025-02-05 20:54:23,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:54:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:54:23,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:54:23,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:54:23,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:54:23,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:54:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-02-05 20:54:24,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:54:24,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628744231] [2025-02-05 20:54:24,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628744231] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:54:24,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248950226] [2025-02-05 20:54:24,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:54:24,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:54:24,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:54:24,053 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-05 20:54:24,055 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-05 20:54:24,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:54:24,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:54:24,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:54:24,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:54:24,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:54:24,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:54:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-02-05 20:54:24,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:54:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248950226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:54:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:54:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:54:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618345376] [2025-02-05 20:54:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:54:24,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:54:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:54:24,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:54:24,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:54:24,296 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 20:54:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:54:24,320 INFO L93 Difference]: Finished difference Result 156 states and 277 transitions. [2025-02-05 20:54:24,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:54:24,322 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-02-05 20:54:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:54:24,326 INFO L225 Difference]: With dead ends: 156 [2025-02-05 20:54:24,326 INFO L226 Difference]: Without dead ends: 78 [2025-02-05 20:54:24,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 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-05 20:54:24,330 INFO L435 NwaCegarLoop]: 120 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, 120 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-05 20:54:24,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:54:24,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-05 20:54:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-05 20:54:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:54:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2025-02-05 20:54:24,367 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 196 [2025-02-05 20:54:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:54:24,367 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2025-02-05 20:54:24,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 20:54:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2025-02-05 20:54:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:54:24,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:54:24,374 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:54:24,380 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-05 20:54:24,574 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-05 20:54:24,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:54:24,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:54:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606720, now seen corresponding path program 1 times [2025-02-05 20:54:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:54:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101842856] [2025-02-05 20:54:24,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:54:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:54:24,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:54:24,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:54:24,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:54:24,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:54:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 20:54:24,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:54:24,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101842856] [2025-02-05 20:54:24,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101842856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:54:24,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:54:24,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:54:24,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807396515] [2025-02-05 20:54:24,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:54:24,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:54:24,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:54:24,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:54:24,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:54:24,823 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 20:54:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:54:24,865 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2025-02-05 20:54:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:54:24,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-02-05 20:54:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:54:24,869 INFO L225 Difference]: With dead ends: 188 [2025-02-05 20:54:24,869 INFO L226 Difference]: Without dead ends: 113 [2025-02-05 20:54:24,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:54:24,870 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 48 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:54:24,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 254 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:54:24,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-05 20:54:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-02-05 20:54:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 66 states have internal predecessors, (81), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 20:54:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 165 transitions. [2025-02-05 20:54:24,888 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 165 transitions. Word has length 196 [2025-02-05 20:54:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:54:24,889 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 165 transitions. [2025-02-05 20:54:24,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 20:54:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 165 transitions. [2025-02-05 20:54:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 20:54:24,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:54:24,891 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:54:24,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:54:24,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:54:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:54:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1840611205, now seen corresponding path program 1 times [2025-02-05 20:54:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:54:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372185404] [2025-02-05 20:54:24,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:54:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:54:24,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 20:54:25,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 20:54:25,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:54:25,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:54:25,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:54:25,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 20:54:25,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 20:54:25,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:54:25,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:54:25,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:54:25,197 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:54:25,198 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:54:25,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:54:25,201 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-05 20:54:25,287 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:54:25,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:54:25 BoogieIcfgContainer [2025-02-05 20:54:25,290 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:54:25,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:54:25,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:54:25,290 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:54:25,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:54:23" (3/4) ... [2025-02-05 20:54:25,293 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:54:25,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:54:25,294 INFO L158 Benchmark]: Toolchain (without parser) took 2317.50ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 62.1MB in the end (delta: 49.5MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2025-02-05 20:54:25,295 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:54:25,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.19ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 97.3MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:54:25,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.73ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 94.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:54:25,296 INFO L158 Benchmark]: Boogie Preprocessor took 39.33ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 92.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:54:25,297 INFO L158 Benchmark]: IcfgBuilder took 388.04ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 71.0MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:54:25,297 INFO L158 Benchmark]: TraceAbstraction took 1635.52ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 62.1MB in the end (delta: 8.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2025-02-05 20:54:25,297 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 142.6MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:54:25,298 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.19ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 97.3MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.73ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 94.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.33ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 92.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 388.04ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 71.0MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1635.52ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 62.1MB in the end (delta: 8.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 142.6MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someUnaryDOUBLEoperation at line 34, overapproximation of someBinaryArithmeticFLOAToperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.5; [L23] unsigned short int var_1_2 = 0; [L24] unsigned short int var_1_3 = 64; [L25] signed long int var_1_4 = 2; [L26] float var_1_5 = 0.0; [L27] float var_1_6 = 4.2; [L28] float var_1_7 = 31.25; [L29] float var_1_8 = 1.375; [L30] unsigned short int var_1_9 = 32; [L31] unsigned char var_1_10 = 1; [L32] float var_1_11 = 0.625; [L33] unsigned short int var_1_12 = 1; [L34] float var_1_13 = -0.25; [L35] signed short int var_1_14 = 4; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 0; [L38] signed short int var_1_17 = 8; [L39] signed short int var_1_18 = 5; [L40] signed short int var_1_19 = 128; [L41] signed long int var_1_20 = -50; [L42] signed short int var_1_21 = -16; [L43] signed short int var_1_22 = 16; [L44] signed short int var_1_23 = 32; [L45] signed short int var_1_24 = 2; [L46] signed short int var_1_25 = -4; VAL [isInitial=0, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_2=0, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L157] isInitial = 1 [L158] FCALL initially() [L159] COND TRUE 1 [L160] FCALL updateLastVariables() [L161] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L101] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L101] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L102] var_1_3 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L103] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L104] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L104] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L105] var_1_4 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L106] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L107] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L107] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L108] var_1_5 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L109] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L110] var_1_6 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L111] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L112] var_1_7 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_8=11/8, var_1_9=32] [L113] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_8=11/8, var_1_9=32] [L114] var_1_8 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L115] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L118] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L118] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L119] var_1_11 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L120] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L121] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L121] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L122] var_1_12 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L123] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L124] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L124] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L125] var_1_15 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L126] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L127] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L127] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L128] var_1_16 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L129] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L130] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L130] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L131] var_1_17 = __VERIFIER_nondet_short() [L132] CALL assume_abort_if_not(var_1_17 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L132] RET assume_abort_if_not(var_1_17 >= -32767) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L133] CALL assume_abort_if_not(var_1_17 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L133] RET assume_abort_if_not(var_1_17 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L134] var_1_18 = __VERIFIER_nondet_short() [L135] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L135] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L136] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L136] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L137] var_1_19 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L138] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L139] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L139] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L140] var_1_22 = __VERIFIER_nondet_short() [L141] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L141] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L142] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L142] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L143] var_1_24 = __VERIFIER_nondet_short() [L144] CALL assume_abort_if_not(var_1_24 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L144] RET assume_abort_if_not(var_1_24 >= -8192) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L145] CALL assume_abort_if_not(var_1_24 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L145] RET assume_abort_if_not(var_1_24 <= 8192) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L146] var_1_25 = __VERIFIER_nondet_short() [L147] CALL assume_abort_if_not(var_1_25 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L147] RET assume_abort_if_not(var_1_25 >= -8191) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L148] CALL assume_abort_if_not(var_1_25 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L148] RET assume_abort_if_not(var_1_25 <= 8191) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L161] RET updateVariables() [L162] CALL step() [L50] signed long int stepLocal_2 = var_1_4; [L51] signed long int stepLocal_1 = var_1_4; [L52] signed long int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L53] COND FALSE !((var_1_2 + var_1_3) < stepLocal_1) [L62] var_1_1 = var_1_8 VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=32] [L64] unsigned char stepLocal_4 = var_1_1 < (var_1_8 / var_1_11); [L65] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=32] [L66] COND FALSE !(var_1_10 || stepLocal_4) [L71] var_1_9 = var_1_12 VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L73] COND FALSE !(\read(var_1_10)) [L76] var_1_13 = ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L78] unsigned char stepLocal_5 = ! (var_1_10 || var_1_15); VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_5=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L79] COND TRUE stepLocal_5 || var_1_16 [L80] var_1_14 = ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L82] COND TRUE \read(var_1_16) [L83] var_1_20 = (var_1_3 - 50) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L85] COND TRUE \read(var_1_15) [L86] var_1_21 = ((var_1_22 + 25) - var_1_19) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L88] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L91] COND TRUE \read(var_1_16) [L92] var_1_23 = var_1_24 VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L162] RET step() [L163] CALL, EXPR property() [L153-L154] return ((((((((var_1_2 + var_1_3) < var_1_4) ? ((var_1_4 <= (var_1_3 - var_1_2)) ? ((var_1_4 < var_1_3) ? (var_1_1 == ((float) ((var_1_5 - var_1_6) - var_1_7))) : 1) : (var_1_1 == ((float) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) + 3.25f)))) : (var_1_1 == ((float) var_1_8))) && ((var_1_10 || (var_1_1 < (var_1_8 / var_1_11))) ? ((var_1_10 || (var_1_1 != var_1_11)) ? (var_1_9 == ((unsigned short int) 8)) : 1) : (var_1_9 == ((unsigned short int) var_1_12)))) && (var_1_10 ? (var_1_13 == ((float) ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))))) : (var_1_13 == ((float) ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))))))) && (((! (var_1_10 || var_1_15)) || var_1_16) ? (var_1_14 == ((signed short int) ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))))) : 1)) && (var_1_16 ? (var_1_20 == ((signed long int) (var_1_3 - 50))) : 1)) && (var_1_15 ? (var_1_21 == ((signed short int) ((var_1_22 + 25) - var_1_19))) : 1)) && (var_1_10 ? (var_1_23 == ((signed short int) (var_1_22 + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_25)))) : (var_1_16 ? (var_1_23 == ((signed short int) var_1_24)) : (var_1_23 == ((signed short int) var_1_17)))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L163] RET, EXPR property() [L163] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 374 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 268 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 437 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 5890/5952 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-05 20:54:25,315 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_codestructure_steplocals_file-93.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 bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:54:27,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:54:27,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:54:27,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:54:27,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:54:27,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:54:27,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:54:27,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:54:27,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:54:27,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:54:27,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:54:27,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:54:27,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:54:27,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:54:27,277 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:54:27,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:54:27,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:54:27,277 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:54:27,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:54:27,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:54:27,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:54:27,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:54:27,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:54:27,278 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:54:27,278 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:54:27,278 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:54:27,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:54:27,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:54:27,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:54:27,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:54:27,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:54:27,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:54:27,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:54:27,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:54:27,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:54:27,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:54:27,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:54:27,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:54:27,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:54:27,279 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:54:27,280 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:54:27,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:54:27,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:54:27,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:54:27,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:54:27,280 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 -> bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd [2025-02-05 20:54:27,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:54:27,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:54:27,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:54:27,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:54:27,531 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:54:27,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-02-05 20:54:28,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11e75c9bc/cad26506eea54b179029408e761dc29b/FLAGd8ffc6dc1 [2025-02-05 20:54:28,986 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:54:28,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-02-05 20:54:28,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11e75c9bc/cad26506eea54b179029408e761dc29b/FLAGd8ffc6dc1 [2025-02-05 20:54:29,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11e75c9bc/cad26506eea54b179029408e761dc29b [2025-02-05 20:54:29,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:54:29,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:54:29,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:54:29,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:54:29,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:54:29,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2201fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29, skipping insertion in model container [2025-02-05 20:54:29,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:54:29,148 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_codestructure_steplocals_file-93.i[917,930] [2025-02-05 20:54:29,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:54:29,213 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:54:29,222 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_codestructure_steplocals_file-93.i[917,930] [2025-02-05 20:54:29,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:54:29,257 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:54:29,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29 WrapperNode [2025-02-05 20:54:29,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:54:29,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:54:29,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:54:29,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:54:29,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,297 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-02-05 20:54:29,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:54:29,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:54:29,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:54:29,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:54:29,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,321 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-05 20:54:29,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:54:29,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:54:29,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:54:29,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:54:29,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (1/1) ... [2025-02-05 20:54:29,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:54:29,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:54:29,368 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-05 20:54:29,370 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-05 20:54:29,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:54:29,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:54:29,386 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:54:29,386 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:54:29,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:54:29,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:54:29,441 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:54:29,443 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:54:34,959 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 20:54:34,960 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:54:34,967 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:54:34,969 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:54:34,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:54:34 BoogieIcfgContainer [2025-02-05 20:54:34,970 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:54:34,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:54:34,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:54:34,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:54:34,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:54:29" (1/3) ... [2025-02-05 20:54:34,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10621840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:54:34, skipping insertion in model container [2025-02-05 20:54:34,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:54:29" (2/3) ... [2025-02-05 20:54:34,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10621840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:54:34, skipping insertion in model container [2025-02-05 20:54:34,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:54:34" (3/3) ... [2025-02-05 20:54:34,979 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-93.i [2025-02-05 20:54:34,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:54:34,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-93.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:54:35,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:54:35,040 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;@45234b78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:54:35,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:54:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:54:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:54:35,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:54:35,054 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:54:35,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:54:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:54:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1863272572, now seen corresponding path program 1 times [2025-02-05 20:54:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:54:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513831590] [2025-02-05 20:54:35,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:54:35,066 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-05 20:54:35,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:54:35,068 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-05 20:54:35,070 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-05 20:54:35,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:54:35,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:54:35,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:54:35,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:54:35,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:54:35,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:54:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-05 20:54:35,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:54:35,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:54:35,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513831590] [2025-02-05 20:54:35,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513831590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:54:35,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:54:35,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:54:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004581966] [2025-02-05 20:54:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:54:35,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:54:35,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:54:35,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:54:35,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:54:35,522 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 20:54:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:54:35,543 INFO L93 Difference]: Finished difference Result 156 states and 277 transitions. [2025-02-05 20:54:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:54:35,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-02-05 20:54:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:54:35,550 INFO L225 Difference]: With dead ends: 156 [2025-02-05 20:54:35,550 INFO L226 Difference]: Without dead ends: 78 [2025-02-05 20:54:35,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 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-05 20:54:35,556 INFO L435 NwaCegarLoop]: 120 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, 120 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-05 20:54:35,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:54:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-05 20:54:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-05 20:54:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:54:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2025-02-05 20:54:35,587 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 196 [2025-02-05 20:54:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:54:35,588 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2025-02-05 20:54:35,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 20:54:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2025-02-05 20:54:35,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:54:35,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:54:35,590 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:54:35,602 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-05 20:54:35,791 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-05 20:54:35,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:54:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:54:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606720, now seen corresponding path program 1 times [2025-02-05 20:54:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:54:35,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055380302] [2025-02-05 20:54:35,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:54:35,793 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-05 20:54:35,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:54:35,796 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-05 20:54:35,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 (3)] Waiting until timeout for monitored process [2025-02-05 20:54:35,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:54:36,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:54:36,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:54:36,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:54:36,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 20:54:36,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:54:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 20:54:36,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:54:36,221 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:54:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055380302] [2025-02-05 20:54:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055380302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:54:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:54:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:54:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835381177] [2025-02-05 20:54:36,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:54:36,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:54:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:54:36,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:54:36,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:54:36,223 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 20:54:40,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:54:44,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:54:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:54:44,703 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2025-02-05 20:54:44,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:54:44,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-02-05 20:54:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:54:44,708 INFO L225 Difference]: With dead ends: 188 [2025-02-05 20:54:44,708 INFO L226 Difference]: Without dead ends: 113 [2025-02-05 20:54:44,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:54:44,709 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 44 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:54:44,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 254 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2025-02-05 20:54:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-05 20:54:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-02-05 20:54:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 66 states have internal predecessors, (81), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 20:54:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 165 transitions. [2025-02-05 20:54:44,725 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 165 transitions. Word has length 196 [2025-02-05 20:54:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:54:44,726 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 165 transitions. [2025-02-05 20:54:44,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 20:54:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 165 transitions. [2025-02-05 20:54:44,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 20:54:44,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:54:44,728 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:54:44,739 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-05 20:54:44,932 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-05 20:54:44,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:54:44,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:54:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1840611205, now seen corresponding path program 1 times [2025-02-05 20:54:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:54:44,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533010936] [2025-02-05 20:54:44,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:54:44,933 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-05 20:54:44,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:54:44,935 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-05 20:54:44,936 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-05 20:54:44,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 20:54:45,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 20:54:45,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:54:45,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:54:45,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 20:54:45,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:55:22,708 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 20:55:48,331 WARN L286 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)