./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-57.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_fillercode_fillercodestructure_filler-ps-ci_file-57.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 f559a5b58158eed52388071b46da432d3b1dc1a4e8637a19e3d18a39a508a801 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:36:06,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:36:06,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:36:06,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:36:06,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:36:06,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:36:06,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:36:06,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:36:06,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:36:06,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:36:06,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:36:06,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:36:06,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:36:06,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:36:06,148 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:36:06,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:36:06,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:36:06,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:36:06,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:36:06,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:36:06,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:36:06,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:36:06,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:36:06,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:36:06,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:36:06,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:36:06,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:36:06,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:36:06,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:36:06,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:36:06,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:36:06,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:36:06,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:36:06,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:36:06,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:36:06,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:36:06,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:36:06,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:36:06,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:36:06,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:36:06,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:36:06,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:36:06,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:36:06,151 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 -> f559a5b58158eed52388071b46da432d3b1dc1a4e8637a19e3d18a39a508a801 [2025-02-05 23:36:06,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:36:06,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:36:06,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:36:06,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:36:06,441 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:36:06,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-57.i [2025-02-05 23:36:07,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94ce8c673/5c520f04dbf1446f9c0c508c4f38d159/FLAG2e7575209 [2025-02-05 23:36:08,142 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:36:08,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-57.i [2025-02-05 23:36:08,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94ce8c673/5c520f04dbf1446f9c0c508c4f38d159/FLAG2e7575209 [2025-02-05 23:36:08,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94ce8c673/5c520f04dbf1446f9c0c508c4f38d159 [2025-02-05 23:36:08,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:36:08,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:36:08,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:36:08,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:36:08,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:36:08,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08, skipping insertion in model container [2025-02-05 23:36:08,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:36:08,336 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_fillercode_fillercodestructure_filler-ps-ci_file-57.i[919,932] [2025-02-05 23:36:08,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:36:08,431 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:36:08,441 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_fillercode_fillercodestructure_filler-ps-ci_file-57.i[919,932] [2025-02-05 23:36:08,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:36:08,508 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:36:08,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08 WrapperNode [2025-02-05 23:36:08,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:36:08,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:36:08,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:36:08,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:36:08,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,563 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 273 [2025-02-05 23:36:08,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:36:08,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:36:08,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:36:08,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:36:08,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,611 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 23:36:08,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,636 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:36:08,655 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:36:08,657 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:36:08,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:36:08,658 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (1/1) ... [2025-02-05 23:36:08,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:36:08,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:08,689 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 23:36:08,694 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 23:36:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:36:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:36:08,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:36:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:36:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:36:08,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:36:08,775 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:36:08,777 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:36:09,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc property_#t~bitwise28#1;havoc property_#t~short29#1;havoc property_#t~bitwise30#1;havoc property_#t~short31#1; [2025-02-05 23:36:09,318 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 23:36:09,318 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:36:09,351 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:36:09,351 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 23:36:09,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:09 BoogieIcfgContainer [2025-02-05 23:36:09,353 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:36:09,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:36:09,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:36:09,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:36:09,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:36:08" (1/3) ... [2025-02-05 23:36:09,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f7ba1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:09, skipping insertion in model container [2025-02-05 23:36:09,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:08" (2/3) ... [2025-02-05 23:36:09,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f7ba1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:09, skipping insertion in model container [2025-02-05 23:36:09,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:09" (3/3) ... [2025-02-05 23:36:09,363 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-57.i [2025-02-05 23:36:09,376 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:36:09,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-57.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:36:09,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:36:09,486 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;@28f711b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:36:09,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:36:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 23:36:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-02-05 23:36:09,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:09,508 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:09,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:09,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1389696616, now seen corresponding path program 1 times [2025-02-05 23:36:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062449067] [2025-02-05 23:36:09,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:09,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:09,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-05 23:36:09,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-05 23:36:09,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:09,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-02-05 23:36:09,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:09,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062449067] [2025-02-05 23:36:09,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062449067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:36:09,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214114067] [2025-02-05 23:36:09,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:09,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:09,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:09,850 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 23:36:09,852 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 23:36:09,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-05 23:36:10,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-05 23:36:10,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:10,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:10,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:36:10,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:36:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-02-05 23:36:10,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:36:10,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214114067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:10,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:36:10,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:36:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656020173] [2025-02-05 23:36:10,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:10,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:36:10,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:10,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:36:10,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:36:10,099 INFO L87 Difference]: Start difference. First operand has 118 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 23:36:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:10,143 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2025-02-05 23:36:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:36:10,146 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 211 [2025-02-05 23:36:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:10,154 INFO L225 Difference]: With dead ends: 230 [2025-02-05 23:36:10,156 INFO L226 Difference]: Without dead ends: 115 [2025-02-05 23:36:10,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 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 23:36:10,164 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:10,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:36:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-05 23:36:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-02-05 23:36:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 23:36:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 180 transitions. [2025-02-05 23:36:10,218 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 180 transitions. Word has length 211 [2025-02-05 23:36:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:10,219 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 180 transitions. [2025-02-05 23:36:10,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 23:36:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 180 transitions. [2025-02-05 23:36:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-02-05 23:36:10,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:10,222 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:10,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 23:36:10,424 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 23:36:10,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:10,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2067009244, now seen corresponding path program 1 times [2025-02-05 23:36:10,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:10,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708993019] [2025-02-05 23:36:10,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:10,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-05 23:36:10,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-05 23:36:10,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:10,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 23:36:10,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:10,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708993019] [2025-02-05 23:36:10,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708993019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:10,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:36:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778094292] [2025-02-05 23:36:10,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:10,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:36:10,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:10,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:36:10,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:36:10,841 INFO L87 Difference]: Start difference. First operand 115 states and 180 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 23:36:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:10,891 INFO L93 Difference]: Finished difference Result 228 states and 359 transitions. [2025-02-05 23:36:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:36:10,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2025-02-05 23:36:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:10,894 INFO L225 Difference]: With dead ends: 228 [2025-02-05 23:36:10,894 INFO L226 Difference]: Without dead ends: 116 [2025-02-05 23:36:10,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 23:36:10,895 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:10,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:36:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-05 23:36:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-05 23:36:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 23:36:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2025-02-05 23:36:10,908 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 211 [2025-02-05 23:36:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:10,909 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2025-02-05 23:36:10,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 23:36:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2025-02-05 23:36:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 23:36:10,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:10,912 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:10,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:36:10,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:10,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash 142687665, now seen corresponding path program 1 times [2025-02-05 23:36:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196959389] [2025-02-05 23:36:10,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:10,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 23:36:11,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 23:36:11,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:11,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 23:36:11,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196959389] [2025-02-05 23:36:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196959389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:11,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:11,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:36:11,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888483645] [2025-02-05 23:36:11,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:11,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:36:11,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:11,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:36:11,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:36:11,764 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 23:36:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:12,322 INFO L93 Difference]: Finished difference Result 295 states and 460 transitions. [2025-02-05 23:36:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:36:12,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 212 [2025-02-05 23:36:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:12,326 INFO L225 Difference]: With dead ends: 295 [2025-02-05 23:36:12,326 INFO L226 Difference]: Without dead ends: 182 [2025-02-05 23:36:12,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:36:12,327 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 245 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:12,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 544 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:36:12,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-05 23:36:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2025-02-05 23:36:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 139 states have (on average 1.4820143884892085) internal successors, (206), 140 states have internal predecessors, (206), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 23:36:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 278 transitions. [2025-02-05 23:36:12,348 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 278 transitions. Word has length 212 [2025-02-05 23:36:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:12,349 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 278 transitions. [2025-02-05 23:36:12,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 23:36:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 278 transitions. [2025-02-05 23:36:12,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 23:36:12,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:12,352 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:12,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:36:12,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:12,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:12,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1431016770, now seen corresponding path program 1 times [2025-02-05 23:36:12,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:12,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261641342] [2025-02-05 23:36:12,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:12,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 23:36:12,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 23:36:12,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:12,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 23:36:13,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:13,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261641342] [2025-02-05 23:36:13,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261641342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:13,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:13,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 23:36:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411411364] [2025-02-05 23:36:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:13,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:36:13,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:13,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:36:13,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:36:13,103 INFO L87 Difference]: Start difference. First operand 178 states and 278 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-02-05 23:36:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:13,810 INFO L93 Difference]: Finished difference Result 647 states and 1005 transitions. [2025-02-05 23:36:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 23:36:13,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 213 [2025-02-05 23:36:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:13,815 INFO L225 Difference]: With dead ends: 647 [2025-02-05 23:36:13,815 INFO L226 Difference]: Without dead ends: 472 [2025-02-05 23:36:13,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:36:13,817 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 725 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:13,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 624 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:36:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-02-05 23:36:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 291. [2025-02-05 23:36:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 218 states have (on average 1.4724770642201834) internal successors, (321), 221 states have internal predecessors, (321), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:36:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 457 transitions. [2025-02-05 23:36:13,887 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 457 transitions. Word has length 213 [2025-02-05 23:36:13,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:13,888 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 457 transitions. [2025-02-05 23:36:13,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-02-05 23:36:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 457 transitions. [2025-02-05 23:36:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 23:36:13,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:13,892 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:13,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:36:13,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:13,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1685753315, now seen corresponding path program 1 times [2025-02-05 23:36:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:13,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007232034] [2025-02-05 23:36:13,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:13,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:13,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 23:36:13,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 23:36:13,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:13,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 23:36:14,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:14,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007232034] [2025-02-05 23:36:14,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007232034] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:36:14,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800967667] [2025-02-05 23:36:14,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:14,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:14,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:14,249 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 23:36:14,251 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 23:36:14,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 23:36:14,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 23:36:14,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:14,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:14,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 23:36:14,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:36:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 267 proven. 87 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2025-02-05 23:36:14,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:36:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 23:36:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800967667] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:36:15,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:36:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-05 23:36:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265914072] [2025-02-05 23:36:15,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:36:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:36:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:15,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:36:15,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:36:15,008 INFO L87 Difference]: Start difference. First operand 291 states and 457 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-02-05 23:36:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:15,530 INFO L93 Difference]: Finished difference Result 594 states and 922 transitions. [2025-02-05 23:36:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 23:36:15,531 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 213 [2025-02-05 23:36:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:15,534 INFO L225 Difference]: With dead ends: 594 [2025-02-05 23:36:15,536 INFO L226 Difference]: Without dead ends: 317 [2025-02-05 23:36:15,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:36:15,538 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 83 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:15,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 722 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:36:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-05 23:36:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2025-02-05 23:36:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 236 states have (on average 1.4364406779661016) internal successors, (339), 239 states have internal predecessors, (339), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:36:15,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 475 transitions. [2025-02-05 23:36:15,584 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 475 transitions. Word has length 213 [2025-02-05 23:36:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:15,584 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 475 transitions. [2025-02-05 23:36:15,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-02-05 23:36:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2025-02-05 23:36:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 23:36:15,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:15,587 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:15,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 23:36:15,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:15,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:15,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2103655356, now seen corresponding path program 1 times [2025-02-05 23:36:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:15,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436667781] [2025-02-05 23:36:15,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:15,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 23:36:15,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 23:36:15,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:15,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 23:36:16,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:16,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436667781] [2025-02-05 23:36:16,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436667781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:16,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:16,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 23:36:16,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613021877] [2025-02-05 23:36:16,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:16,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 23:36:16,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:16,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 23:36:16,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:36:16,390 INFO L87 Difference]: Start difference. First operand 313 states and 475 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 23:36:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:17,803 INFO L93 Difference]: Finished difference Result 1409 states and 2124 transitions. [2025-02-05 23:36:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 23:36:17,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 213 [2025-02-05 23:36:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:17,817 INFO L225 Difference]: With dead ends: 1409 [2025-02-05 23:36:17,817 INFO L226 Difference]: Without dead ends: 1114 [2025-02-05 23:36:17,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:36:17,819 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 533 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:17,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1237 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 23:36:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-02-05 23:36:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 985. [2025-02-05 23:36:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 756 states have (on average 1.4153439153439153) internal successors, (1070), 767 states have internal predecessors, (1070), 202 states have call successors, (202), 26 states have call predecessors, (202), 26 states have return successors, (202), 191 states have call predecessors, (202), 202 states have call successors, (202) [2025-02-05 23:36:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1474 transitions. [2025-02-05 23:36:17,945 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1474 transitions. Word has length 213 [2025-02-05 23:36:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:17,947 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1474 transitions. [2025-02-05 23:36:17,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 23:36:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1474 transitions. [2025-02-05 23:36:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 23:36:17,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:17,951 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:17,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:36:17,951 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:17,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash -822469607, now seen corresponding path program 1 times [2025-02-05 23:36:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719612570] [2025-02-05 23:36:17,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:17,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 23:36:17,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 23:36:17,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:17,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 23:36:18,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:18,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719612570] [2025-02-05 23:36:18,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719612570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:18,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:18,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 23:36:18,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917093800] [2025-02-05 23:36:18,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:18,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 23:36:18,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:18,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 23:36:18,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:36:18,285 INFO L87 Difference]: Start difference. First operand 985 states and 1474 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 23:36:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:19,230 INFO L93 Difference]: Finished difference Result 2390 states and 3564 transitions. [2025-02-05 23:36:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 23:36:19,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-02-05 23:36:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:19,245 INFO L225 Difference]: With dead ends: 2390 [2025-02-05 23:36:19,245 INFO L226 Difference]: Without dead ends: 1423 [2025-02-05 23:36:19,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:36:19,252 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 361 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:19,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 989 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:36:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-02-05 23:36:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1033. [2025-02-05 23:36:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 804 states have (on average 1.4241293532338308) internal successors, (1145), 815 states have internal predecessors, (1145), 202 states have call successors, (202), 26 states have call predecessors, (202), 26 states have return successors, (202), 191 states have call predecessors, (202), 202 states have call successors, (202) [2025-02-05 23:36:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1549 transitions. [2025-02-05 23:36:19,395 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1549 transitions. Word has length 214 [2025-02-05 23:36:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:19,395 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1549 transitions. [2025-02-05 23:36:19,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 23:36:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1549 transitions. [2025-02-05 23:36:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 23:36:19,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:19,400 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:19,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:36:19,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:19,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 355306682, now seen corresponding path program 1 times [2025-02-05 23:36:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:19,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018163798] [2025-02-05 23:36:19,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:19,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 23:36:19,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 23:36:19,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:19,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 23:36:19,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:19,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018163798] [2025-02-05 23:36:19,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018163798] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:36:19,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229029132] [2025-02-05 23:36:19,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:19,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:19,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:19,697 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:36:19,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 23:36:19,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 23:36:19,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 23:36:19,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:19,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:19,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 23:36:19,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:36:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 423 proven. 9 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2025-02-05 23:36:19,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:36:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 23:36:20,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229029132] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:36:20,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:36:20,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 23:36:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564939259] [2025-02-05 23:36:20,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:36:20,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:36:20,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:20,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:36:20,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:36:20,132 INFO L87 Difference]: Start difference. First operand 1033 states and 1549 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-02-05 23:36:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:20,444 INFO L93 Difference]: Finished difference Result 1446 states and 2163 transitions. [2025-02-05 23:36:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:36:20,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 214 [2025-02-05 23:36:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:20,450 INFO L225 Difference]: With dead ends: 1446 [2025-02-05 23:36:20,450 INFO L226 Difference]: Without dead ends: 431 [2025-02-05 23:36:20,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:36:20,454 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 243 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:20,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 328 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:36:20,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-05 23:36:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 425. [2025-02-05 23:36:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 312 states have internal predecessors, (420), 102 states have call successors, (102), 13 states have call predecessors, (102), 13 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 23:36:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 624 transitions. [2025-02-05 23:36:20,504 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 624 transitions. Word has length 214 [2025-02-05 23:36:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:20,505 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 624 transitions. [2025-02-05 23:36:20,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-02-05 23:36:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 624 transitions. [2025-02-05 23:36:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 23:36:20,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:20,509 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:20,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 23:36:20,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:20,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:20,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:20,710 INFO L85 PathProgramCache]: Analyzing trace with hash 277405535, now seen corresponding path program 1 times [2025-02-05 23:36:20,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:20,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141126842] [2025-02-05 23:36:20,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:20,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:20,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 23:36:20,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 23:36:20,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:20,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 23:36:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141126842] [2025-02-05 23:36:20,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141126842] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:36:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203951241] [2025-02-05 23:36:20,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:20,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:20,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:20,998 INFO L229 MonitoredProcess]: Starting monitored process 5 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 23:36:21,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 23:36:21,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 23:36:21,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 23:36:21,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:21,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:21,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 23:36:21,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:36:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 879 proven. 30 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2025-02-05 23:36:21,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:36:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 23:36:21,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203951241] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:36:21,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:36:21,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 15 [2025-02-05 23:36:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885065933] [2025-02-05 23:36:21,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:36:21,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 23:36:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:21,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 23:36:21,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:36:21,674 INFO L87 Difference]: Start difference. First operand 425 states and 624 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) [2025-02-05 23:36:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:22,321 INFO L93 Difference]: Finished difference Result 876 states and 1268 transitions. [2025-02-05 23:36:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 23:36:22,321 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) Word has length 215 [2025-02-05 23:36:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:22,325 INFO L225 Difference]: With dead ends: 876 [2025-02-05 23:36:22,325 INFO L226 Difference]: Without dead ends: 469 [2025-02-05 23:36:22,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2025-02-05 23:36:22,330 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 233 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:22,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 660 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:36:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-05 23:36:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 451. [2025-02-05 23:36:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 329 states have (on average 1.337386018237082) internal successors, (440), 332 states have internal predecessors, (440), 102 states have call successors, (102), 19 states have call predecessors, (102), 19 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 23:36:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 644 transitions. [2025-02-05 23:36:22,393 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 644 transitions. Word has length 215 [2025-02-05 23:36:22,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:22,393 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 644 transitions. [2025-02-05 23:36:22,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) [2025-02-05 23:36:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 644 transitions. [2025-02-05 23:36:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 23:36:22,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:22,397 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:22,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 23:36:22,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-05 23:36:22,598 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:22,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:22,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1760650754, now seen corresponding path program 1 times [2025-02-05 23:36:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:22,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841224283] [2025-02-05 23:36:22,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:22,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 23:36:22,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 23:36:22,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:22,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 23:36:22,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1017119652] [2025-02-05 23:36:22,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:22,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:22,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:22,704 INFO L229 MonitoredProcess]: Starting monitored process 6 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 23:36:22,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 23:36:22,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 23:36:22,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 23:36:22,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:22,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:22,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 23:36:22,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:36:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-02-05 23:36:23,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:36:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 23:36:23,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:23,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841224283] [2025-02-05 23:36:23,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 23:36:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017119652] [2025-02-05 23:36:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017119652] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:36:23,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:36:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-05 23:36:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732894150] [2025-02-05 23:36:23,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 23:36:23,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:36:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:23,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:36:23,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:36:23,748 INFO L87 Difference]: Start difference. First operand 451 states and 644 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-02-05 23:36:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:24,699 INFO L93 Difference]: Finished difference Result 1242 states and 1773 transitions. [2025-02-05 23:36:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 23:36:24,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 215 [2025-02-05 23:36:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:24,705 INFO L225 Difference]: With dead ends: 1242 [2025-02-05 23:36:24,706 INFO L226 Difference]: Without dead ends: 809 [2025-02-05 23:36:24,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:36:24,708 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 260 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:24,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 458 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:36:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-05 23:36:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 790. [2025-02-05 23:36:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 583 states have (on average 1.3379073756432247) internal successors, (780), 589 states have internal predecessors, (780), 174 states have call successors, (174), 32 states have call predecessors, (174), 32 states have return successors, (174), 168 states have call predecessors, (174), 174 states have call successors, (174) [2025-02-05 23:36:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1128 transitions. [2025-02-05 23:36:24,781 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1128 transitions. Word has length 215 [2025-02-05 23:36:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:24,783 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1128 transitions. [2025-02-05 23:36:24,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-02-05 23:36:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1128 transitions. [2025-02-05 23:36:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 23:36:24,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:24,786 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:24,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 23:36:24,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 23:36:24,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:24,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:24,992 INFO L85 PathProgramCache]: Analyzing trace with hash -350959489, now seen corresponding path program 1 times [2025-02-05 23:36:24,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:24,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884594839] [2025-02-05 23:36:24,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:24,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:25,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 23:36:25,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 23:36:25,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:25,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 57 proven. 123 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-02-05 23:36:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884594839] [2025-02-05 23:36:25,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884594839] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:36:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131773075] [2025-02-05 23:36:25,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:25,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:25,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:25,473 INFO L229 MonitoredProcess]: Starting monitored process 7 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 23:36:25,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 23:36:25,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 23:36:25,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 23:36:25,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:25,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:25,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 23:36:25,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:36:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-02-05 23:36:25,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:36:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 23:36:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131773075] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:36:26,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:36:26,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-02-05 23:36:26,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043772275] [2025-02-05 23:36:26,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:36:26,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:36:26,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:26,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:36:26,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:36:26,067 INFO L87 Difference]: Start difference. First operand 790 states and 1128 transitions. Second operand has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 5 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (76), 5 states have call predecessors, (76), 5 states have call successors, (76) [2025-02-05 23:36:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:26,652 INFO L93 Difference]: Finished difference Result 1559 states and 2198 transitions. [2025-02-05 23:36:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:36:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 5 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (76), 5 states have call predecessors, (76), 5 states have call successors, (76) Word has length 216 [2025-02-05 23:36:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:26,659 INFO L225 Difference]: With dead ends: 1559 [2025-02-05 23:36:26,659 INFO L226 Difference]: Without dead ends: 863 [2025-02-05 23:36:26,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-05 23:36:26,662 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 469 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:26,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 587 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:36:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-02-05 23:36:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 833. [2025-02-05 23:36:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 616 states have (on average 1.3198051948051948) internal successors, (813), 622 states have internal predecessors, (813), 174 states have call successors, (174), 42 states have call predecessors, (174), 42 states have return successors, (174), 168 states have call predecessors, (174), 174 states have call successors, (174) [2025-02-05 23:36:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1161 transitions. [2025-02-05 23:36:26,797 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1161 transitions. Word has length 216 [2025-02-05 23:36:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:26,797 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1161 transitions. [2025-02-05 23:36:26,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 5 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (76), 5 states have call predecessors, (76), 5 states have call successors, (76) [2025-02-05 23:36:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1161 transitions. [2025-02-05 23:36:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 23:36:26,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:26,801 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:26,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 23:36:27,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 23:36:27,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:27,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1726249854, now seen corresponding path program 1 times [2025-02-05 23:36:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:27,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919156362] [2025-02-05 23:36:27,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 23:36:27,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 23:36:27,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:27,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 23:36:27,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564345073] [2025-02-05 23:36:27,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:27,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:27,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:27,111 INFO L229 MonitoredProcess]: Starting monitored process 8 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 23:36:27,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 23:36:27,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 23:36:27,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 23:36:27,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:27,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:36:27,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 23:36:27,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 23:36:27,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 23:36:27,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:27,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:36:27,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 23:36:27,555 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 23:36:27,556 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 23:36:27,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 23:36:27,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:27,768 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:27,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 23:36:27,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:36:27 BoogieIcfgContainer [2025-02-05 23:36:27,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 23:36:27,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 23:36:27,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 23:36:27,895 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 23:36:27,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:09" (3/4) ... [2025-02-05 23:36:27,897 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 23:36:27,898 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 23:36:27,899 INFO L158 Benchmark]: Toolchain (without parser) took 19726.20ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 107.0MB in the beginning and 263.4MB in the end (delta: -156.4MB). Peak memory consumption was 169.8MB. Max. memory is 16.1GB. [2025-02-05 23:36:27,899 INFO L158 Benchmark]: CDTParser took 1.50ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:36:27,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.12ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 91.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 23:36:27,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.95ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 85.1MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:36:27,900 INFO L158 Benchmark]: Boogie Preprocessor took 90.65ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 78.7MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 23:36:27,900 INFO L158 Benchmark]: IcfgBuilder took 697.89ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 39.1MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 23:36:27,900 INFO L158 Benchmark]: TraceAbstraction took 18539.11ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 38.4MB in the beginning and 263.5MB in the end (delta: -225.0MB). Peak memory consumption was 102.7MB. Max. memory is 16.1GB. [2025-02-05 23:36:27,900 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 469.8MB. Free memory was 263.5MB in the beginning and 263.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:36:27,901 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.50ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.12ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 91.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.95ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 85.1MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 90.65ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 78.7MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 697.89ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 39.1MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18539.11ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 38.4MB in the beginning and 263.5MB in the end (delta: -225.0MB). Peak memory consumption was 102.7MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 469.8MB. Free memory was 263.5MB in the beginning and 263.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of bitwiseOr at line 58, overapproximation of someUnaryDOUBLEoperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed char var_1_2 = -1; [L24] signed char var_1_3 = 10; [L25] signed long int var_1_5 = 5; [L26] unsigned char var_1_6 = 0; [L27] double var_1_7 = 24.8; [L28] double var_1_8 = 500.5; [L29] double var_1_9 = 2.4; [L30] double var_1_10 = 0.4; [L31] double var_1_11 = 255.8; [L32] double var_1_12 = 50.75; [L33] unsigned char var_1_13 = 4; [L34] unsigned char var_1_14 = 200; [L35] unsigned char var_1_15 = 25; [L36] unsigned char var_1_16 = 128; [L37] unsigned char var_1_17 = 64; [L38] unsigned char var_1_18 = 32; [L39] unsigned char var_1_19 = 32; [L40] unsigned long int var_1_20 = 1; [L41] float var_1_21 = 9999999999.2; [L42] double var_1_23 = 10.875; [L43] unsigned char var_1_24 = 0; [L44] unsigned char var_1_25 = 0; [L45] float var_1_26 = 1000000000000.6; [L46] unsigned long int var_1_27 = 2609431563; [L47] float var_1_30 = 8.8; [L48] unsigned short int var_1_32 = 1; [L49] signed char var_1_36 = 64; [L50] float var_1_37 = 9.5; [L51] signed long int var_1_41 = 200; [L52] signed char var_1_42 = 2; [L53] signed long int var_1_43 = 2; VAL [isInitial=0, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=-1, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L131] var_1_2 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L132] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L134] var_1_3 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L135] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L136] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L136] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L137] var_1_5 = __VERIFIER_nondet_long() [L138] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L138] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L139] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L139] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L140] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L140] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L141] var_1_6 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L143] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L143] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L144] var_1_8 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L145] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L146] var_1_9 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L147] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L148] var_1_10 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L149] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L150] var_1_11 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L151] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L152] var_1_12 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L153] RET assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L154] var_1_14 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_14 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L155] RET assume_abort_if_not(var_1_14 >= 190) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L156] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L156] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L157] var_1_15 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L158] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L159] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L159] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L160] var_1_16 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L161] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L162] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L162] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L163] var_1_17 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L164] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L165] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L165] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L166] var_1_18 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L168] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L168] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L169] var_1_19 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L170] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L171] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L171] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L172] var_1_25 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L173] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L174] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L174] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L175] var_1_27 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L176] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L177] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L177] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L178] var_1_37 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L179] RET assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L180] CALL assume_abort_if_not(var_1_37 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L180] RET assume_abort_if_not(var_1_37 != 0.0F) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L193] RET updateVariables() [L194] CALL step() [L57] var_1_24 = var_1_25 VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L58] EXPR 25u | (var_1_27 - 5u) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L58] COND TRUE (25u | (var_1_27 - 5u)) >= var_1_5 [L59] var_1_26 = (((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) < 0 ) ? -((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) : ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) VAL [isInitial=1, var_1_11=0, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5] [L65] COND TRUE var_1_10 < var_1_8 [L66] var_1_30 = ((((var_1_8) > (var_1_11)) ? (var_1_8) : (var_1_11))) VAL [isInitial=1, var_1_11=0, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=3] [L68] EXPR (var_1_1 / var_1_14) & var_1_5 VAL [isInitial=1, var_1_11=0, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=3] [L68] COND TRUE (-1 - var_1_15) < ((var_1_1 / var_1_14) & var_1_5) [L69] EXPR var_1_14 >> var_1_15 VAL [isInitial=1, var_1_11=0, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=3] [L69] COND TRUE (- ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < (var_1_14 >> var_1_15) [L70] var_1_32 = var_1_15 VAL [isInitial=1, var_1_11=0, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=3] [L77] COND FALSE !(var_1_10 < ((var_1_8 / var_1_37) + var_1_11)) [L82] var_1_36 = ((((var_1_18) > ((var_1_18 - var_1_18))) ? (var_1_18) : ((var_1_18 - var_1_18)))) VAL [isInitial=1, var_1_11=0, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=3] [L84] EXPR var_1_27 >> var_1_15 VAL [isInitial=1, var_1_11=0, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=3] [L84] COND FALSE !((var_1_27 >> var_1_15) <= var_1_18) [L87] var_1_42 = var_1_17 [L88] var_1_43 = var_1_3 [L89] signed char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_7=124/5, var_1_8=3] [L90] COND TRUE -256 <= stepLocal_0 [L91] var_1_7 = (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))) VAL [isInitial=1, var_1_11=0, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L97] COND TRUE var_1_11 <= var_1_9 [L98] var_1_13 = ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) VAL [isInitial=1, var_1_11=0, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L100] COND TRUE (var_1_2 - var_1_3) > (var_1_13 / var_1_5) [L101] var_1_1 = (128 - var_1_3) VAL [isInitial=1, var_1_11=0, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L109] EXPR (var_1_2 * var_1_13) & var_1_1 VAL [isInitial=1, var_1_11=0, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L109] signed long int stepLocal_1 = (var_1_2 * var_1_13) & var_1_1; [L110] COND FALSE !(var_1_3 < stepLocal_1) VAL [isInitial=1, var_1_11=0, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L113] EXPR var_1_1 & var_1_3 VAL [isInitial=1, var_1_11=0, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L113] signed long int stepLocal_2 = var_1_1 & var_1_3; [L114] COND FALSE !((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= stepLocal_2) [L121] var_1_21 = var_1_12 VAL [isInitial=1, var_1_11=0, var_1_12=4, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=4, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L123] unsigned long int stepLocal_3 = var_1_20; VAL [isInitial=1, stepLocal_3=1, var_1_11=0, var_1_12=4, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=4, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L124] COND TRUE var_1_1 > stepLocal_3 VAL [isInitial=1, var_1_11=0, var_1_12=4, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=4, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L125] COND TRUE ! (! var_1_6) [L126] var_1_23 = var_1_8 VAL [isInitial=1, var_1_11=0, var_1_12=4, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=4, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR (((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1) VAL [isInitial=1, var_1_11=0, var_1_12=4, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=4, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L185] EXPR ((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12))) VAL [isInitial=1, var_1_11=0, var_1_12=4, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=4, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L185-L186] return (((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12)))) && ((var_1_1 > var_1_20) ? ((! (! var_1_6)) ? (var_1_23 == ((double) var_1_8)) : 1) : 1) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=0, var_1_12=4, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=4, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] [L19] reach_error() VAL [isInitial=1, var_1_11=0, var_1_12=4, var_1_13=127, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=-448, var_1_18=-256, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=4, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=8589934571, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=0, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-1, var_1_6=1, var_1_8=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 12, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3223 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3152 mSDsluCounter, 6658 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4663 mSDsCounter, 524 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5373 IncrementalHoareTripleChecker+Invalid, 5897 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 524 mSolverCounterUnsat, 1995 mSDtfsCounter, 5373 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2466 GetRequests, 2349 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1033occurred in iteration=7, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 781 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 4063 NumberOfCodeBlocks, 4063 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4468 ConstructedInterpolants, 1 QuantifiedInterpolants, 9998 SizeOfPredicates, 13 NumberOfNonLiveVariables, 2873 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 40939/41664 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 23:36:27,941 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_fillercode_fillercodestructure_filler-ps-ci_file-57.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 f559a5b58158eed52388071b46da432d3b1dc1a4e8637a19e3d18a39a508a801 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:36:30,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:36:30,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 23:36:30,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:36:30,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:36:30,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:36:30,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:36:30,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:36:30,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:36:30,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:36:30,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:36:30,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:36:30,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:36:30,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:36:30,410 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:36:30,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:36:30,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:36:30,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:36:30,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:36:30,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:36:30,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:36:30,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:36:30,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:36:30,411 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 23:36:30,412 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 23:36:30,412 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 23:36:30,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:36:30,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:36:30,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:36:30,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:36:30,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:36:30,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:36:30,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:36:30,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:36:30,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:36:30,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:36:30,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:36:30,414 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:36:30,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:36:30,414 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 23:36:30,414 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 23:36:30,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:36:30,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:36:30,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:36:30,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:36:30,420 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 -> f559a5b58158eed52388071b46da432d3b1dc1a4e8637a19e3d18a39a508a801 [2025-02-05 23:36:30,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:36:30,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:36:30,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:36:30,696 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:36:30,696 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:36:30,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-57.i [2025-02-05 23:36:32,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71f3c5363/802c31038e0d4d85a14dac15177f023e/FLAG9204bbdbe [2025-02-05 23:36:32,436 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:36:32,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-57.i [2025-02-05 23:36:32,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71f3c5363/802c31038e0d4d85a14dac15177f023e/FLAG9204bbdbe [2025-02-05 23:36:32,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71f3c5363/802c31038e0d4d85a14dac15177f023e [2025-02-05 23:36:32,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:36:32,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:36:32,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:36:32,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:36:32,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:36:32,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a56ffa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32, skipping insertion in model container [2025-02-05 23:36:32,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:36:32,643 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_fillercode_fillercodestructure_filler-ps-ci_file-57.i[919,932] [2025-02-05 23:36:32,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:36:32,750 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:36:32,764 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_fillercode_fillercodestructure_filler-ps-ci_file-57.i[919,932] [2025-02-05 23:36:32,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:36:32,836 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:36:32,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32 WrapperNode [2025-02-05 23:36:32,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:36:32,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:36:32,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:36:32,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:36:32,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,890 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-02-05 23:36:32,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:36:32,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:36:32,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:36:32,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:36:32,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,917 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 23:36:32,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,927 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:36:32,935 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:36:32,935 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:36:32,935 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:36:32,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (1/1) ... [2025-02-05 23:36:32,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:36:32,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:32,976 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 23:36:32,983 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 23:36:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:36:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 23:36:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:36:33,003 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:36:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:36:33,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:36:33,069 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:36:33,071 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:36:50,328 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-05 23:36:50,329 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:36:50,343 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:36:50,343 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:36:50,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:50 BoogieIcfgContainer [2025-02-05 23:36:50,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:36:50,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:36:50,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:36:50,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:36:50,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:36:32" (1/3) ... [2025-02-05 23:36:50,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f071597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:50, skipping insertion in model container [2025-02-05 23:36:50,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:32" (2/3) ... [2025-02-05 23:36:50,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f071597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:50, skipping insertion in model container [2025-02-05 23:36:50,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:50" (3/3) ... [2025-02-05 23:36:50,353 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-57.i [2025-02-05 23:36:50,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:36:50,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-57.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:36:50,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:36:50,435 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;@6a19c10a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:36:50,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:36:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 23:36:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 23:36:50,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:50,450 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:50,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:50,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2120852278, now seen corresponding path program 1 times [2025-02-05 23:36:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:36:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588051464] [2025-02-05 23:36:50,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:50,468 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 23:36:50,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:36:50,472 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 23:36:50,474 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 23:36:50,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 23:36:51,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 23:36:51,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:51,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:51,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:36:51,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:36:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 23:36:51,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:36:51,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:36:51,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588051464] [2025-02-05 23:36:51,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588051464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:51,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:51,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 23:36:51,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997283923] [2025-02-05 23:36:51,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:51,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:36:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:36:51,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:36:51,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:36:51,777 INFO L87 Difference]: Start difference. First operand has 90 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 23:36:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:51,802 INFO L93 Difference]: Finished difference Result 173 states and 307 transitions. [2025-02-05 23:36:51,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:36:51,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 202 [2025-02-05 23:36:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:51,809 INFO L225 Difference]: With dead ends: 173 [2025-02-05 23:36:51,809 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 23:36:51,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 201 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 23:36:51,816 INFO L435 NwaCegarLoop]: 133 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, 133 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 23:36:51,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:36:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 23:36:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-05 23:36:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 23:36:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2025-02-05 23:36:51,857 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 202 [2025-02-05 23:36:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:51,859 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2025-02-05 23:36:51,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 23:36:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2025-02-05 23:36:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 23:36:51,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:51,867 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:51,912 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 23:36:52,067 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 23:36:52,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:52,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1491434246, now seen corresponding path program 1 times [2025-02-05 23:36:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:36:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584281784] [2025-02-05 23:36:52,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:52,070 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 23:36:52,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:36:52,072 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 23:36:52,073 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 23:36:52,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 23:36:53,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 23:36:53,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:53,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-05 23:36:53,685 INFO L279 TraceCheckSpWp]: Computing forward predicates...