./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.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_normal_file-51.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 bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:36:02,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:36:02,367 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:36:02,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:36:02,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:36:02,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:36:02,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:36:02,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:36:02,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:36:02,400 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:36:02,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:36:02,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:36:02,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:36:02,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:36:02,402 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:36:02,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:36:02,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:36:02,402 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:36:02,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:36:02,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:36:02,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:36:02,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:36:02,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:36:02,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:36:02,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:36:02,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:36:02,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:36:02,403 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:36:02,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:36:02,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:36:02,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:36:02,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:36:02,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:02,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:36:02,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:36:02,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:36:02,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:36:02,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:36:02,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:36:02,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:36:02,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:36:02,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:36:02,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:36:02,405 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 -> bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf [2025-02-05 20:36:02,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:36:02,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:36:02,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:36:02,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:36:02,656 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:36:02,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2025-02-05 20:36:03,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b72c06f7a/e805b778313e4746a7512816bfe3fe51/FLAGf61e4bdee [2025-02-05 20:36:04,102 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:36:04,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2025-02-05 20:36:04,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b72c06f7a/e805b778313e4746a7512816bfe3fe51/FLAGf61e4bdee [2025-02-05 20:36:04,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b72c06f7a/e805b778313e4746a7512816bfe3fe51 [2025-02-05 20:36:04,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:36:04,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:36:04,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:04,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:36:04,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:36:04,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac9803e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04, skipping insertion in model container [2025-02-05 20:36:04,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:36:04,258 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_normal_file-51.i[913,926] [2025-02-05 20:36:04,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:04,325 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:36:04,334 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_normal_file-51.i[913,926] [2025-02-05 20:36:04,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:04,373 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:36:04,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04 WrapperNode [2025-02-05 20:36:04,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:04,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:04,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:36:04,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:36:04,378 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:36:04" (1/1) ... [2025-02-05 20:36:04,384 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:36:04" (1/1) ... [2025-02-05 20:36:04,401 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2025-02-05 20:36:04,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:04,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:36:04,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:36:04,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:36:04,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,420 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:36:04,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:36:04,429 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:36:04,429 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:36:04,429 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:36:04,430 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (1/1) ... [2025-02-05 20:36:04,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:04,456 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:36:04,458 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:36:04,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:36:04,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:36:04,473 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:36:04,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:36:04,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:36:04,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:36:04,532 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:36:04,533 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:36:04,752 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:36:04,753 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:36:04,764 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:36:04,764 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:36:04,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:04 BoogieIcfgContainer [2025-02-05 20:36:04,764 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:36:04,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:36:04,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:36:04,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:36:04,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:36:04" (1/3) ... [2025-02-05 20:36:04,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0c23ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:36:04, skipping insertion in model container [2025-02-05 20:36:04,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:04" (2/3) ... [2025-02-05 20:36:04,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0c23ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:36:04, skipping insertion in model container [2025-02-05 20:36:04,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:04" (3/3) ... [2025-02-05 20:36:04,779 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-51.i [2025-02-05 20:36:04,789 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:36:04,790 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-51.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:36:04,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:36:04,835 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;@397362fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:36:04,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:36:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:36:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 20:36:04,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:04,847 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:04,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:04,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1910241403, now seen corresponding path program 1 times [2025-02-05 20:36:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:36:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013597687] [2025-02-05 20:36:04,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:04,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:36:04,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 20:36:04,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 20:36:04,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:04,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 20:36:05,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:36:05,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013597687] [2025-02-05 20:36:05,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013597687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:36:05,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40828251] [2025-02-05 20:36:05,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:05,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:05,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:05,100 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:36:05,101 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:36:05,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 20:36:05,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 20:36:05,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:05,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:05,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:36:05,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 20:36:05,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:36:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40828251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:36:05,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:36:05,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:36:05,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995507680] [2025-02-05 20:36:05,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:36:05,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:36:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:36:05,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:36:05,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:36:05,289 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 20:36:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:05,307 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2025-02-05 20:36:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:36:05,308 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 182 [2025-02-05 20:36:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:05,313 INFO L225 Difference]: With dead ends: 148 [2025-02-05 20:36:05,313 INFO L226 Difference]: Without dead ends: 74 [2025-02-05 20:36:05,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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:36:05,317 INFO L435 NwaCegarLoop]: 115 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, 115 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:36:05,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:36:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-05 20:36:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-05 20:36:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:36:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 115 transitions. [2025-02-05 20:36:05,348 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 115 transitions. Word has length 182 [2025-02-05 20:36:05,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:05,348 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 115 transitions. [2025-02-05 20:36:05,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 20:36:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 115 transitions. [2025-02-05 20:36:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 20:36:05,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:05,351 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:05,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:36:05,551 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:36:05,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:05,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1480329377, now seen corresponding path program 1 times [2025-02-05 20:36:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:36:05,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240514287] [2025-02-05 20:36:05,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:36:05,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 20:36:05,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 20:36:05,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:05,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 20:36:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:36:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240514287] [2025-02-05 20:36:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240514287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:36:05,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:36:05,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:36:05,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591259290] [2025-02-05 20:36:05,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:36:05,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:36:05,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:36:05,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:36:05,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:36:05,735 INFO L87 Difference]: Start difference. First operand 74 states and 115 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 20:36:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:05,766 INFO L93 Difference]: Finished difference Result 190 states and 294 transitions. [2025-02-05 20:36:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:36:05,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 182 [2025-02-05 20:36:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:05,769 INFO L225 Difference]: With dead ends: 190 [2025-02-05 20:36:05,769 INFO L226 Difference]: Without dead ends: 119 [2025-02-05 20:36:05,769 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:36:05,770 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 66 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:36:05,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 218 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:36:05,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-05 20:36:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2025-02-05 20:36:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-05 20:36:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 179 transitions. [2025-02-05 20:36:05,787 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 179 transitions. Word has length 182 [2025-02-05 20:36:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:05,787 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 179 transitions. [2025-02-05 20:36:05,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 20:36:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 179 transitions. [2025-02-05 20:36:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 20:36:05,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:05,790 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:05,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:36:05,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:05,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1991096598, now seen corresponding path program 1 times [2025-02-05 20:36:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:36:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757750695] [2025-02-05 20:36:05,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:36:05,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 20:36:05,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 20:36:05,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:05,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 20:36:06,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:36:06,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757750695] [2025-02-05 20:36:06,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757750695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:36:06,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26011661] [2025-02-05 20:36:06,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:06,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:06,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:06,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:36:06,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:36:06,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 20:36:06,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 20:36:06,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:06,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:06,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 20:36:06,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-02-05 20:36:06,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:36:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 20:36:06,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26011661] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:36:06,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:36:06,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 20:36:06,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124561756] [2025-02-05 20:36:06,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:36:06,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:36:06,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:36:06,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:36:06,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:36:06,702 INFO L87 Difference]: Start difference. First operand 116 states and 179 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2025-02-05 20:36:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:06,891 INFO L93 Difference]: Finished difference Result 241 states and 365 transitions. [2025-02-05 20:36:06,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:36:06,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) Word has length 183 [2025-02-05 20:36:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:06,895 INFO L225 Difference]: With dead ends: 241 [2025-02-05 20:36:06,895 INFO L226 Difference]: Without dead ends: 128 [2025-02-05 20:36:06,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:36:06,896 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 88 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:36:06,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 167 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:36:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-05 20:36:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-02-05 20:36:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 73 states have internal predecessors, (89), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-05 20:36:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2025-02-05 20:36:06,915 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 183 [2025-02-05 20:36:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:06,917 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2025-02-05 20:36:06,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2025-02-05 20:36:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2025-02-05 20:36:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 20:36:06,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:06,922 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:06,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:36:07,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:07,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:07,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash -248286263, now seen corresponding path program 1 times [2025-02-05 20:36:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:36:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928674183] [2025-02-05 20:36:07,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:36:07,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 20:36:07,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 20:36:07,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:07,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:36:07,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:36:07,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 20:36:07,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 20:36:07,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:07,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:36:07,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:36:07,343 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:36:07,343 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:36:07,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:36:07,346 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-05 20:36:07,442 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:36:07,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:36:07 BoogieIcfgContainer [2025-02-05 20:36:07,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:36:07,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:36:07,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:36:07,445 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:36:07,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:04" (3/4) ... [2025-02-05 20:36:07,447 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:36:07,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:36:07,448 INFO L158 Benchmark]: Toolchain (without parser) took 3321.46ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 114.2MB in the beginning and 232.8MB in the end (delta: -118.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-02-05 20:36:07,448 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:07,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.07ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 100.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:36:07,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.50ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:07,449 INFO L158 Benchmark]: Boogie Preprocessor took 26.66ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:07,449 INFO L158 Benchmark]: IcfgBuilder took 334.89ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 75.2MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:36:07,449 INFO L158 Benchmark]: TraceAbstraction took 2678.57ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 75.2MB in the beginning and 232.8MB in the end (delta: -157.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:07,450 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 302.0MB. Free memory was 232.8MB in the beginning and 232.8MB in the end (delta: 63.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:07,451 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.07ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 100.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.50ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.66ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 334.89ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 75.2MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2678.57ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 75.2MB in the beginning and 232.8MB in the end (delta: -157.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 302.0MB. Free memory was 232.8MB in the beginning and 232.8MB in the end (delta: 63.9kB). 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 someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] unsigned long int var_1_2 = 32; [L24] unsigned long int var_1_3 = 128; [L25] double var_1_4 = 32.3; [L26] double var_1_5 = 0.25; [L27] double var_1_6 = 500.6; [L28] unsigned char var_1_7 = 2; [L29] signed char var_1_8 = -10; [L30] signed char var_1_9 = 5; [L31] signed char var_1_10 = 4; [L32] signed char var_1_11 = 100; [L33] unsigned long int var_1_12 = 8; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L36] unsigned long int var_1_15 = 1114432789; [L37] unsigned long int var_1_16 = 2; [L38] double var_1_17 = 256.8; [L39] double var_1_18 = 1.25; [L40] unsigned long int var_1_19 = 16; [L41] unsigned char var_1_21 = 1; [L42] double var_1_22 = -0.5; [L43] unsigned char var_1_23 = 0; [L44] unsigned char var_1_24 = 1; VAL [isInitial=0, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=32, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L151] isInitial = 1 [L152] FCALL initially() [L153] COND TRUE 1 [L154] FCALL updateLastVariables() [L155] CALL updateVariables() [L96] var_1_2 = __VERIFIER_nondet_ulong() [L97] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L97] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L98] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L98] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L99] var_1_3 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L100] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_4 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_5 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L106] var_1_6 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L107] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L108] var_1_7 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L109] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L110] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L110] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L111] var_1_9 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L112] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L113] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L113] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L114] var_1_10 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L115] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L116] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L116] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L117] var_1_11 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L118] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L119] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L119] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L120] var_1_13 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L121] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L122] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L122] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L123] var_1_14 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L124] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L125] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L125] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L126] var_1_15 = __VERIFIER_nondet_ulong() [L127] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L127] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L128] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L128] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L129] var_1_16 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L130] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L131] CALL assume_abort_if_not(var_1_16 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L131] RET assume_abort_if_not(var_1_16 <= 1073741823) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L132] var_1_18 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L133] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L134] var_1_22 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L135] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L136] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L136] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L137] var_1_23 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L138] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L139] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L139] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L140] var_1_24 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L141] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L142] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L142] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=-1] [L155] RET updateVariables() [L156] CALL step() [L48] COND FALSE !(32u >= var_1_2) [L55] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=254, var_1_8=-10, var_1_9=-1] [L57] COND TRUE ! (var_1_6 > var_1_5) [L58] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=254, var_1_8=-1, var_1_9=-1] [L62] COND TRUE var_1_13 && var_1_14 [L63] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=254, var_1_8=-1, var_1_9=-1] [L69] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=254, var_1_8=-1, var_1_9=-1] [L72] COND TRUE var_1_14 || (((((var_1_4) > (var_1_6)) ? (var_1_4) : (var_1_6))) > var_1_18) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=254, var_1_8=-1, var_1_9=-1] [L73] COND TRUE var_1_18 > ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) [L74] var_1_19 = var_1_16 VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=1073741823, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=254, var_1_8=-1, var_1_9=-1] [L81] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L92] var_1_21 = var_1_23 VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=1073741823, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=254, var_1_8=-1, var_1_9=-1] [L156] RET step() [L157] CALL, EXPR property() [L147-L148] return ((((((32u >= var_1_2) ? ((var_1_2 <= var_1_3) ? (((var_1_4 - var_1_5) >= var_1_6) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_6 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_13 && var_1_14) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_13 ? (var_1_12 == ((unsigned long int) (((((var_1_1) > ((var_1_11 + var_1_7))) ? (var_1_1) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_16)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((var_1_14 || (((((var_1_4) > (var_1_6)) ? (var_1_4) : (var_1_6))) > var_1_18)) ? ((var_1_18 > ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) ? (var_1_19 == ((unsigned long int) var_1_16)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) var_1_16)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_2 < var_1_3) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=1073741823, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_3=0, var_1_7=254, var_1_8=-1, var_1_9=-1] [L157] RET, EXPR property() [L157] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=1073741823, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_3=0, var_1_7=254, var_1_8=-1, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-4611686011984936961, var_1_16=1073741823, var_1_17=1284/5, var_1_19=1073741823, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_3=0, var_1_7=254, var_1_8=-1, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 304 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1089 ConstructedInterpolants, 0 QuantifiedInterpolants, 1505 SizeOfPredicates, 3 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 10238/10440 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:36:07,467 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_normal_file-51.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 bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:36:09,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:36:09,436 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:36:09,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:36:09,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:36:09,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:36:09,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:36:09,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:36:09,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:36:09,468 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:36:09,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:36:09,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:36:09,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:36:09,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:36:09,469 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:36:09,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:36:09,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:36:09,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:36:09,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:36:09,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:36:09,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:36:09,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:36:09,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:36:09,470 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:36:09,470 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:36:09,470 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:36:09,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:36:09,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:36:09,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:36:09,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:36:09,481 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:36:09,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:36:09,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:36:09,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:36:09,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:09,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:36:09,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:36:09,482 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:36:09,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:36:09,482 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:36:09,482 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:36:09,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:36:09,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:36:09,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:36:09,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:36:09,482 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 -> bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf [2025-02-05 20:36:09,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:36:09,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:36:09,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:36:09,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:36:09,703 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:36:09,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2025-02-05 20:36:10,972 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21649d3fa/deb56348758e4af581aee9fbe69d8765/FLAGc75d8d370 [2025-02-05 20:36:11,227 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:36:11,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2025-02-05 20:36:11,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21649d3fa/deb56348758e4af581aee9fbe69d8765/FLAGc75d8d370 [2025-02-05 20:36:11,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21649d3fa/deb56348758e4af581aee9fbe69d8765 [2025-02-05 20:36:11,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:36:11,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:36:11,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:11,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:36:11,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:36:11,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123e3d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11, skipping insertion in model container [2025-02-05 20:36:11,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:36:11,384 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_normal_file-51.i[913,926] [2025-02-05 20:36:11,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:11,451 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:36:11,459 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_normal_file-51.i[913,926] [2025-02-05 20:36:11,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:11,505 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:36:11,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11 WrapperNode [2025-02-05 20:36:11,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:11,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:11,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:36:11,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:36:11,511 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:36:11" (1/1) ... [2025-02-05 20:36:11,517 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:36:11" (1/1) ... [2025-02-05 20:36:11,533 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2025-02-05 20:36:11,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:11,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:36:11,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:36:11,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:36:11,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,549 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:36:11,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:36:11,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:36:11,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:36:11,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:36:11,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (1/1) ... [2025-02-05 20:36:11,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:11,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:11,595 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:36:11,600 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:36:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:36:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:36:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:36:11,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:36:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:36:11,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:36:11,680 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:36:11,681 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:36:25,104 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:36:25,104 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:36:25,110 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:36:25,111 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:36:25,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:25 BoogieIcfgContainer [2025-02-05 20:36:25,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:36:25,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:36:25,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:36:25,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:36:25,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:36:11" (1/3) ... [2025-02-05 20:36:25,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6077438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:36:25, skipping insertion in model container [2025-02-05 20:36:25,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:11" (2/3) ... [2025-02-05 20:36:25,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6077438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:36:25, skipping insertion in model container [2025-02-05 20:36:25,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:25" (3/3) ... [2025-02-05 20:36:25,117 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-51.i [2025-02-05 20:36:25,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:36:25,129 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-51.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:36:25,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:36:25,190 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;@219f73f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:36:25,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:36:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:36:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 20:36:25,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:25,206 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:25,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:25,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:25,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1910241403, now seen corresponding path program 1 times [2025-02-05 20:36:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:36:25,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941021265] [2025-02-05 20:36:25,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:25,231 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:36:25,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:36:25,233 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:36:25,235 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:36:25,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 20:36:25,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 20:36:25,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:25,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:25,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:36:25,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2025-02-05 20:36:26,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:36:26,006 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:36:26,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941021265] [2025-02-05 20:36:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941021265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:36:26,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:36:26,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:36:26,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830576836] [2025-02-05 20:36:26,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:36:26,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:36:26,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:36:26,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:36:26,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:36:26,030 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 20:36:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:26,054 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2025-02-05 20:36:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:36:26,055 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 182 [2025-02-05 20:36:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:26,060 INFO L225 Difference]: With dead ends: 148 [2025-02-05 20:36:26,060 INFO L226 Difference]: Without dead ends: 74 [2025-02-05 20:36:26,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 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:36:26,064 INFO L435 NwaCegarLoop]: 115 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, 115 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:36:26,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:36:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-05 20:36:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-05 20:36:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:36:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 115 transitions. [2025-02-05 20:36:26,092 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 115 transitions. Word has length 182 [2025-02-05 20:36:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:26,092 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 115 transitions. [2025-02-05 20:36:26,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 20:36:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 115 transitions. [2025-02-05 20:36:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 20:36:26,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:26,096 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:26,132 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:36:26,296 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:36:26,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:26,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:26,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1480329377, now seen corresponding path program 1 times [2025-02-05 20:36:26,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:36:26,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639737616] [2025-02-05 20:36:26,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:26,299 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:36:26,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:36:26,301 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:36:26,301 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:36:26,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 20:36:27,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 20:36:27,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:27,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:27,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 20:36:27,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-02-05 20:36:29,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:36:29,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:36:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639737616] [2025-02-05 20:36:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639737616] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:36:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2108146432] [2025-02-05 20:36:29,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:29,428 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 20:36:29,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 20:36:29,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 20:36:29,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-02-05 20:36:29,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 20:36:29,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 20:36:29,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:29,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:29,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 20:36:29,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 20:36:29,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:36:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2108146432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:36:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:36:29,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 20:36:29,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2767706] [2025-02-05 20:36:29,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:36:29,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:36:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:36:29,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:36:29,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:36:29,961 INFO L87 Difference]: Start difference. First operand 74 states and 115 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 20:36:34,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:36:38,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:36:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:38,325 INFO L93 Difference]: Finished difference Result 190 states and 294 transitions. [2025-02-05 20:36:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:36:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 182 [2025-02-05 20:36:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:38,404 INFO L225 Difference]: With dead ends: 190 [2025-02-05 20:36:38,404 INFO L226 Difference]: Without dead ends: 119 [2025-02-05 20:36:38,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:36:38,405 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 66 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:36:38,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 218 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-05 20:36:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-05 20:36:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2025-02-05 20:36:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-05 20:36:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 179 transitions. [2025-02-05 20:36:38,442 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 179 transitions. Word has length 182 [2025-02-05 20:36:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:38,442 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 179 transitions. [2025-02-05 20:36:38,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 20:36:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 179 transitions. [2025-02-05 20:36:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 20:36:38,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:38,444 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:38,462 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:36:38,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-02-05 20:36:38,848 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 20:36:38,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:38,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1991096598, now seen corresponding path program 1 times [2025-02-05 20:36:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:36:38,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120653666] [2025-02-05 20:36:38,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:38,849 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:36:38,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:36:38,855 INFO L229 MonitoredProcess]: Starting monitored process 5 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:36:38,856 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 (5)] Waiting until timeout for monitored process [2025-02-05 20:36:38,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 20:36:39,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 20:36:39,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:39,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:39,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 20:36:39,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-02-05 20:36:41,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:36:41,915 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:36:41,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120653666] [2025-02-05 20:36:41,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120653666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:36:41,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1071570940] [2025-02-05 20:36:41,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:41,916 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 20:36:41,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 20:36:41,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 20:36:41,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-05 20:36:41,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 20:36:43,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 20:36:43,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:43,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:43,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 20:36:43,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-02-05 20:36:45,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:36:45,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1071570940] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:36:45,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:36:45,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-02-05 20:36:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818410514] [2025-02-05 20:36:45,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:36:45,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:36:45,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:36:45,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:36:45,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:36:45,377 INFO L87 Difference]: Start difference. First operand 116 states and 179 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 20:36:51,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:36:55,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:36:59,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:36:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:59,635 INFO L93 Difference]: Finished difference Result 241 states and 365 transitions. [2025-02-05 20:36:59,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:36:59,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 183 [2025-02-05 20:36:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:59,721 INFO L225 Difference]: With dead ends: 241 [2025-02-05 20:36:59,721 INFO L226 Difference]: Without dead ends: 128 [2025-02-05 20:36:59,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:36:59,730 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 51 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:36:59,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 169 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 3 Unknown, 0 Unchecked, 14.0s Time] [2025-02-05 20:36:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-05 20:36:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-02-05 20:36:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 73 states have internal predecessors, (89), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-05 20:36:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2025-02-05 20:36:59,764 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 183 [2025-02-05 20:36:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:59,765 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2025-02-05 20:36:59,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 20:36:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2025-02-05 20:36:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 20:36:59,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:59,767 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:59,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-02-05 20:36:59,985 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 (5)] Ended with exit code 0 [2025-02-05 20:37:00,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /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:37:00,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:37:00,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:37:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash -248286263, now seen corresponding path program 1 times [2025-02-05 20:37:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:37:00,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998695608] [2025-02-05 20:37:00,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:37:00,171 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:37:00,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:37:00,179 INFO L229 MonitoredProcess]: Starting monitored process 7 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:37:00,180 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 (7)] Waiting until timeout for monitored process [2025-02-05 20:37:00,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 20:37:00,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 20:37:00,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:37:00,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:37:00,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 20:37:00,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:37:14,635 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 20:37:23,008 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 20:37:31,354 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 20:37:39,711 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 20:37:48,081 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)