./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.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_fillercodesize_ps-cn-10_file-4.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 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:23:21,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:23:21,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:23:21,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:23:21,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:23:21,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:23:21,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:23:21,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:23:21,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:23:21,215 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:23:21,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:23:21,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:23:21,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:23:21,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:23:21,216 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:23:21,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:23:21,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:23:21,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:23:21,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:23:21,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:23:21,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:23:21,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:23:21,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:23:21,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:23:21,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:23:21,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:23:21,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:23:21,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:23:21,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:23:21,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:23:21,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:23:21,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:23:21,218 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 -> 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 [2025-02-05 21:23:21,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:23:21,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:23:21,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:23:21,435 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:23:21,436 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:23:21,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2025-02-05 21:23:22,577 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9519edc14/f4eac8cddcec4f5492cb8c2ce5513ddb/FLAG47a5281a5 [2025-02-05 21:23:22,793 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:23:22,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2025-02-05 21:23:22,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9519edc14/f4eac8cddcec4f5492cb8c2ce5513ddb/FLAG47a5281a5 [2025-02-05 21:23:23,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9519edc14/f4eac8cddcec4f5492cb8c2ce5513ddb [2025-02-05 21:23:23,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:23:23,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:23:23,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:23:23,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:23:23,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:23:23,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6350a18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23, skipping insertion in model container [2025-02-05 21:23:23,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:23:23,289 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_fillercodesize_ps-cn-10_file-4.i[914,927] [2025-02-05 21:23:23,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:23:23,411 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:23:23,430 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_fillercodesize_ps-cn-10_file-4.i[914,927] [2025-02-05 21:23:23,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:23:23,479 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:23:23,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23 WrapperNode [2025-02-05 21:23:23,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:23:23,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:23:23,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:23:23,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:23:23,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,528 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2025-02-05 21:23:23,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:23:23,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:23:23,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:23:23,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:23:23,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,549 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:23:23,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:23:23,558 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:23:23,558 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:23:23,558 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:23:23,559 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (1/1) ... [2025-02-05 21:23:23,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:23:23,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:23:23,588 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 21:23:23,590 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 21:23:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:23:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:23:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:23:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:23:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:23:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:23:23,674 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:23:23,675 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:23:24,026 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 21:23:24,028 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:23:24,035 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:23:24,038 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:23:24,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:23:24 BoogieIcfgContainer [2025-02-05 21:23:24,038 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:23:24,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:23:24,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:23:24,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:23:24,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:23:23" (1/3) ... [2025-02-05 21:23:24,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1187549f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:23:24, skipping insertion in model container [2025-02-05 21:23:24,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:23" (2/3) ... [2025-02-05 21:23:24,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1187549f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:23:24, skipping insertion in model container [2025-02-05 21:23:24,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:23:24" (3/3) ... [2025-02-05 21:23:24,048 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2025-02-05 21:23:24,059 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:23:24,060 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:23:24,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:23:24,118 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;@6f3d2b54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:23:24,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:23:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 21:23:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-05 21:23:24,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:24,141 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:24,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:24,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1444461401, now seen corresponding path program 1 times [2025-02-05 21:23:24,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:23:24,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266151322] [2025-02-05 21:23:24,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:24,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:23:24,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 21:23:24,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 21:23:24,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:24,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 21:23:24,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:23:24,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266151322] [2025-02-05 21:23:24,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266151322] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:23:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893313875] [2025-02-05 21:23:24,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:24,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:23:24,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:23:24,690 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 21:23:24,701 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 21:23:24,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 21:23:24,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 21:23:24,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:24,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:24,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:23:24,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:23:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 21:23:24,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:23:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893313875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:23:24,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:23:24,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:23:24,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440334683] [2025-02-05 21:23:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:23:24,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:23:24,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:23:24,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:23:24,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:23:24,925 INFO L87 Difference]: Start difference. First operand has 80 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 21:23:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:24,949 INFO L93 Difference]: Finished difference Result 154 states and 271 transitions. [2025-02-05 21:23:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:23:24,951 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 186 [2025-02-05 21:23:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:24,956 INFO L225 Difference]: With dead ends: 154 [2025-02-05 21:23:24,956 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 21:23:24,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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 21:23:24,962 INFO L435 NwaCegarLoop]: 117 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, 117 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 21:23:24,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:23:24,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 21:23:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-05 21:23:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 21:23:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-02-05 21:23:24,995 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 186 [2025-02-05 21:23:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:24,996 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-02-05 21:23:24,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 21:23:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-02-05 21:23:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 21:23:25,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:25,001 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:25,012 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 21:23:25,202 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 21:23:25,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:25,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash -737942386, now seen corresponding path program 1 times [2025-02-05 21:23:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:23:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916613126] [2025-02-05 21:23:25,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:23:25,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 21:23:25,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 21:23:25,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:25,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 21:23:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:23:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916613126] [2025-02-05 21:23:26,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916613126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:23:26,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:23:26,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:23:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795099545] [2025-02-05 21:23:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:23:26,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:23:26,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:23:26,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:23:26,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:23:26,197 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:26,427 INFO L93 Difference]: Finished difference Result 252 states and 378 transitions. [2025-02-05 21:23:26,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:23:26,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2025-02-05 21:23:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:26,430 INFO L225 Difference]: With dead ends: 252 [2025-02-05 21:23:26,430 INFO L226 Difference]: Without dead ends: 178 [2025-02-05 21:23:26,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:23:26,431 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 162 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:26,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 455 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:23:26,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-05 21:23:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2025-02-05 21:23:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 90 states have internal predecessors, (114), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 21:23:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 234 transitions. [2025-02-05 21:23:26,454 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 234 transitions. Word has length 187 [2025-02-05 21:23:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:26,455 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 234 transitions. [2025-02-05 21:23:26,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 234 transitions. [2025-02-05 21:23:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 21:23:26,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:26,457 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:26,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:23:26,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:26,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash -737018865, now seen corresponding path program 1 times [2025-02-05 21:23:26,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:23:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971346315] [2025-02-05 21:23:26,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:23:26,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 21:23:26,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 21:23:26,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:26,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 21:23:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:23:30,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971346315] [2025-02-05 21:23:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971346315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:23:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:23:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:23:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359443526] [2025-02-05 21:23:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:23:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:23:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:23:30,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:23:30,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:23:30,027 INFO L87 Difference]: Start difference. First operand 153 states and 234 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:31,649 INFO L93 Difference]: Finished difference Result 486 states and 725 transitions. [2025-02-05 21:23:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:23:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2025-02-05 21:23:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:31,660 INFO L225 Difference]: With dead ends: 486 [2025-02-05 21:23:31,660 INFO L226 Difference]: Without dead ends: 336 [2025-02-05 21:23:31,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:23:31,662 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 162 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:31,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 592 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:23:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-05 21:23:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 241. [2025-02-05 21:23:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 146 states have (on average 1.2534246575342465) internal successors, (183), 146 states have internal predecessors, (183), 90 states have call successors, (90), 4 states have call predecessors, (90), 4 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 21:23:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 363 transitions. [2025-02-05 21:23:31,728 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 363 transitions. Word has length 187 [2025-02-05 21:23:31,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:31,728 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 363 transitions. [2025-02-05 21:23:31,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 363 transitions. [2025-02-05 21:23:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 21:23:31,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:31,734 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:23:31,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:31,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash -607936146, now seen corresponding path program 1 times [2025-02-05 21:23:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:23:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388268751] [2025-02-05 21:23:31,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:23:31,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 21:23:31,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 21:23:31,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:31,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 21:23:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:23:31,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388268751] [2025-02-05 21:23:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388268751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:23:31,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:23:31,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:23:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727723882] [2025-02-05 21:23:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:23:31,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:23:31,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:23:31,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:23:31,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:23:31,923 INFO L87 Difference]: Start difference. First operand 241 states and 363 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:31,991 INFO L93 Difference]: Finished difference Result 548 states and 834 transitions. [2025-02-05 21:23:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:23:31,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2025-02-05 21:23:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:31,995 INFO L225 Difference]: With dead ends: 548 [2025-02-05 21:23:31,996 INFO L226 Difference]: Without dead ends: 391 [2025-02-05 21:23:31,997 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 21:23:31,998 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 58 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:31,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 230 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:23:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-05 21:23:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2025-02-05 21:23:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 232 states have (on average 1.2456896551724137) internal successors, (289), 232 states have internal predecessors, (289), 150 states have call successors, (150), 6 states have call predecessors, (150), 6 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-02-05 21:23:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 589 transitions. [2025-02-05 21:23:32,049 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 589 transitions. Word has length 187 [2025-02-05 21:23:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:32,050 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 589 transitions. [2025-02-05 21:23:32,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 589 transitions. [2025-02-05 21:23:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 21:23:32,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:32,052 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:32,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:23:32,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2051902665, now seen corresponding path program 1 times [2025-02-05 21:23:32,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:23:32,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854503251] [2025-02-05 21:23:32,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:23:32,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:32,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:32,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:32,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 21:23:32,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:23:32,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854503251] [2025-02-05 21:23:32,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854503251] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:23:32,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956988282] [2025-02-05 21:23:32,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:32,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:23:32,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:23:32,242 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 21:23:32,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:23:32,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:32,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:32,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:32,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:32,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:23:32,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:23:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 347 proven. 78 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2025-02-05 21:23:32,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:23:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 21:23:32,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956988282] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:23:32,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:23:32,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 21:23:32,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944646522] [2025-02-05 21:23:32,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:23:32,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:23:32,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:23:32,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:23:32,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:23:32,797 INFO L87 Difference]: Start difference. First operand 389 states and 589 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-02-05 21:23:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:32,983 INFO L93 Difference]: Finished difference Result 716 states and 1061 transitions. [2025-02-05 21:23:32,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:23:32,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 188 [2025-02-05 21:23:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:32,986 INFO L225 Difference]: With dead ends: 716 [2025-02-05 21:23:32,987 INFO L226 Difference]: Without dead ends: 414 [2025-02-05 21:23:32,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:23:32,990 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:32,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 165 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:23:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-05 21:23:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 378. [2025-02-05 21:23:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 216 states have (on average 1.1342592592592593) internal successors, (245), 216 states have internal predecessors, (245), 150 states have call successors, (150), 11 states have call predecessors, (150), 11 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-02-05 21:23:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 545 transitions. [2025-02-05 21:23:33,043 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 545 transitions. Word has length 188 [2025-02-05 21:23:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:33,044 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 545 transitions. [2025-02-05 21:23:33,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-02-05 21:23:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 545 transitions. [2025-02-05 21:23:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 21:23:33,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:33,046 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:33,056 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 21:23:33,250 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 21:23:33,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:33,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash -226129353, now seen corresponding path program 1 times [2025-02-05 21:23:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:23:33,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485352965] [2025-02-05 21:23:33,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:23:33,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:33,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:33,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:33,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 21:23:33,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:23:33,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485352965] [2025-02-05 21:23:33,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485352965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:23:33,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:23:33,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:23:33,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775170037] [2025-02-05 21:23:33,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:23:33,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:23:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:23:33,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:23:33,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:23:33,402 INFO L87 Difference]: Start difference. First operand 378 states and 545 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:33,573 INFO L93 Difference]: Finished difference Result 673 states and 974 transitions. [2025-02-05 21:23:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:23:33,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2025-02-05 21:23:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:33,577 INFO L225 Difference]: With dead ends: 673 [2025-02-05 21:23:33,578 INFO L226 Difference]: Without dead ends: 522 [2025-02-05 21:23:33,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:23:33,579 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 112 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:33,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 419 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:23:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-05 21:23:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 518. [2025-02-05 21:23:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 292 states have (on average 1.1232876712328768) internal successors, (328), 292 states have internal predecessors, (328), 210 states have call successors, (210), 15 states have call predecessors, (210), 15 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2025-02-05 21:23:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 748 transitions. [2025-02-05 21:23:33,639 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 748 transitions. Word has length 188 [2025-02-05 21:23:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:33,639 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 748 transitions. [2025-02-05 21:23:33,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 748 transitions. [2025-02-05 21:23:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 21:23:33,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:33,640 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:33,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:23:33,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:33,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:33,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2033583816, now seen corresponding path program 1 times [2025-02-05 21:23:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:23:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585629154] [2025-02-05 21:23:33,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:23:33,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:33,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:33,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:33,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 51 proven. 117 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2025-02-05 21:23:34,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:23:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585629154] [2025-02-05 21:23:34,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585629154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:23:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51068964] [2025-02-05 21:23:34,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:34,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:23:34,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:23:34,247 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 21:23:34,254 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 21:23:34,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:34,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:34,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:34,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:34,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 21:23:34,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:23:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 677 proven. 201 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2025-02-05 21:23:35,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:23:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 48 proven. 123 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2025-02-05 21:23:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51068964] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:23:36,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:23:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 29 [2025-02-05 21:23:36,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828946034] [2025-02-05 21:23:36,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:23:36,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 21:23:36,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:23:36,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 21:23:36,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2025-02-05 21:23:36,253 INFO L87 Difference]: Start difference. First operand 518 states and 748 transitions. Second operand has 29 states, 28 states have (on average 4.25) internal successors, (119), 27 states have internal predecessors, (119), 10 states have call successors, (90), 4 states have call predecessors, (90), 8 states have return successors, (90), 10 states have call predecessors, (90), 10 states have call successors, (90) [2025-02-05 21:23:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:38,777 INFO L93 Difference]: Finished difference Result 1014 states and 1389 transitions. [2025-02-05 21:23:38,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-02-05 21:23:38,778 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.25) internal successors, (119), 27 states have internal predecessors, (119), 10 states have call successors, (90), 4 states have call predecessors, (90), 8 states have return successors, (90), 10 states have call predecessors, (90), 10 states have call successors, (90) Word has length 188 [2025-02-05 21:23:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:38,784 INFO L225 Difference]: With dead ends: 1014 [2025-02-05 21:23:38,787 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 21:23:38,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1847, Invalid=5293, Unknown=0, NotChecked=0, Total=7140 [2025-02-05 21:23:38,791 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1005 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:38,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 581 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:23:38,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 21:23:38,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 380. [2025-02-05 21:23:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 227 states have (on average 1.0881057268722467) internal successors, (247), 228 states have internal predecessors, (247), 128 states have call successors, (128), 24 states have call predecessors, (128), 24 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-05 21:23:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 503 transitions. [2025-02-05 21:23:38,885 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 503 transitions. Word has length 188 [2025-02-05 21:23:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:38,885 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 503 transitions. [2025-02-05 21:23:38,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.25) internal successors, (119), 27 states have internal predecessors, (119), 10 states have call successors, (90), 4 states have call predecessors, (90), 8 states have return successors, (90), 10 states have call predecessors, (90), 10 states have call successors, (90) [2025-02-05 21:23:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 503 transitions. [2025-02-05 21:23:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 21:23:38,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:38,887 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:38,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 21:23:39,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:23:39,091 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:39,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:39,093 INFO L85 PathProgramCache]: Analyzing trace with hash -283057035, now seen corresponding path program 1 times [2025-02-05 21:23:39,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:23:39,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013526188] [2025-02-05 21:23:39,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:39,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:23:39,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:39,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:39,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 21:23:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:23:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013526188] [2025-02-05 21:23:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013526188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:23:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836383359] [2025-02-05 21:23:39,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:39,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:23:39,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:23:39,351 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 21:23:39,352 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 21:23:39,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:39,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:39,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:39,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:39,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 21:23:39,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:23:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 143 proven. 84 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2025-02-05 21:23:39,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:23:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 21:23:39,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836383359] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:23:39,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:23:39,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-05 21:23:39,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709684180] [2025-02-05 21:23:39,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:23:39,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:23:39,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:23:39,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:23:39,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:23:39,893 INFO L87 Difference]: Start difference. First operand 380 states and 503 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-02-05 21:23:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:40,450 INFO L93 Difference]: Finished difference Result 871 states and 1123 transitions. [2025-02-05 21:23:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:23:40,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 188 [2025-02-05 21:23:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:40,459 INFO L225 Difference]: With dead ends: 871 [2025-02-05 21:23:40,459 INFO L226 Difference]: Without dead ends: 573 [2025-02-05 21:23:40,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 371 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-02-05 21:23:40,461 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 104 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:40,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 506 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:23:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-05 21:23:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 400. [2025-02-05 21:23:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 244 states have (on average 1.0819672131147542) internal successors, (264), 245 states have internal predecessors, (264), 128 states have call successors, (128), 27 states have call predecessors, (128), 27 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-05 21:23:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 520 transitions. [2025-02-05 21:23:40,504 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 520 transitions. Word has length 188 [2025-02-05 21:23:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:40,504 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 520 transitions. [2025-02-05 21:23:40,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-02-05 21:23:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 520 transitions. [2025-02-05 21:23:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 21:23:40,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:40,505 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:40,514 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 21:23:40,710 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,SelfDestructingSolverStorable7 [2025-02-05 21:23:40,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:40,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:40,711 INFO L85 PathProgramCache]: Analyzing trace with hash -282133514, now seen corresponding path program 1 times [2025-02-05 21:23:40,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:23:40,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113750582] [2025-02-05 21:23:40,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:40,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:23:40,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:40,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:40,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:40,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 21:23:40,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:23:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113750582] [2025-02-05 21:23:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113750582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:23:40,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:23:40,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:23:40,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914082136] [2025-02-05 21:23:40,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:23:40,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:23:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:23:40,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:23:40,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:23:40,799 INFO L87 Difference]: Start difference. First operand 400 states and 520 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:40,843 INFO L93 Difference]: Finished difference Result 633 states and 819 transitions. [2025-02-05 21:23:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:23:40,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2025-02-05 21:23:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:40,845 INFO L225 Difference]: With dead ends: 633 [2025-02-05 21:23:40,845 INFO L226 Difference]: Without dead ends: 303 [2025-02-05 21:23:40,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 21:23:40,847 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:40,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:23:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-05 21:23:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-02-05 21:23:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 183 states have (on average 1.0546448087431695) internal successors, (193), 184 states have internal predecessors, (193), 98 states have call successors, (98), 21 states have call predecessors, (98), 21 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2025-02-05 21:23:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 389 transitions. [2025-02-05 21:23:40,882 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 389 transitions. Word has length 188 [2025-02-05 21:23:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:40,882 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 389 transitions. [2025-02-05 21:23:40,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 389 transitions. [2025-02-05 21:23:40,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 21:23:40,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:40,884 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:40,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:23:40,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:40,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash 990414640, now seen corresponding path program 1 times [2025-02-05 21:23:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:23:40,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818899041] [2025-02-05 21:23:40,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:40,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:23:40,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 21:23:40,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 21:23:40,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:40,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:23:40,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127557810] [2025-02-05 21:23:40,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:40,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:23:40,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:23:40,973 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 21:23:40,976 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 21:23:41,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 21:23:41,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 21:23:41,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:41,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:23:41,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 21:23:41,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 21:23:41,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 21:23:41,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:41,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:23:41,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 21:23:41,192 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 21:23:41,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 21:23:41,203 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 21:23:41,394 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 21:23:41,398 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:41,485 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 21:23:41,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 09:23:41 BoogieIcfgContainer [2025-02-05 21:23:41,488 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 21:23:41,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 21:23:41,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 21:23:41,489 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 21:23:41,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:23:24" (3/4) ... [2025-02-05 21:23:41,500 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 21:23:41,500 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 21:23:41,504 INFO L158 Benchmark]: Toolchain (without parser) took 18338.57ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 108.9MB in the beginning and 666.0MB in the end (delta: -557.1MB). Peak memory consumption was 416.7MB. Max. memory is 16.1GB. [2025-02-05 21:23:41,504 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 226.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:23:41,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.06ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 94.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 21:23:41,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.84ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:23:41,505 INFO L158 Benchmark]: Boogie Preprocessor took 29.24ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 86.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 21:23:41,505 INFO L158 Benchmark]: IcfgBuilder took 480.39ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 63.9MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 21:23:41,505 INFO L158 Benchmark]: TraceAbstraction took 17446.79ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 62.7MB in the beginning and 260.2MB in the end (delta: -197.5MB). Peak memory consumption was 357.2MB. Max. memory is 16.1GB. [2025-02-05 21:23:41,505 INFO L158 Benchmark]: Witness Printer took 11.46ms. Allocated memory is still 704.6MB. Free memory was 260.2MB in the beginning and 666.0MB in the end (delta: -405.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2025-02-05 21:23:41,506 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 226.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.06ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 94.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.84ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.24ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 86.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 480.39ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 63.9MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17446.79ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 62.7MB in the beginning and 260.2MB in the end (delta: -197.5MB). Peak memory consumption was 357.2MB. Max. memory is 16.1GB. * Witness Printer took 11.46ms. Allocated memory is still 704.6MB. Free memory was 260.2MB in the beginning and 666.0MB in the end (delta: -405.8MB). Peak memory consumption was 9.2MB. 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 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] unsigned short int var_1_27 = 256; [L44] unsigned char var_1_28 = 0; [L45] unsigned short int var_1_29 = 39250; [L46] unsigned short int var_1_30 = 256; [L47] unsigned short int var_1_31 = 25; [L48] unsigned short int var_1_32 = 4; [L49] signed char var_1_33 = -8; [L50] signed char var_1_34 = -2; [L51] unsigned short int last_1_var_1_6 = 4; [L52] unsigned short int last_1_var_1_9 = 4; [L53] unsigned long int last_1_var_1_14 = 500; [L54] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] isInitial = 1 [L172] FCALL initially() [L173] COND TRUE 1 [L174] CALL updateLastVariables() [L161] last_1_var_1_6 = var_1_6 [L162] last_1_var_1_9 = var_1_9 [L163] last_1_var_1_14 = var_1_14 [L164] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET updateLastVariables() [L175] CALL updateVariables() [L113] var_1_4 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L114] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] var_1_5 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L117] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] var_1_10 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] var_1_12 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L123] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L124] var_1_13 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L125] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L126] var_1_15 = __VERIFIER_nondet_ulong() [L127] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L127] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L129] var_1_16 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L130] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L132] var_1_19 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L133] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] var_1_20 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L136] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] var_1_21 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] var_1_22 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L142] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] var_1_24 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L145] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] var_1_28 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] var_1_29 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] var_1_30 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] var_1_31 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] RET updateVariables() [L176] CALL step() [L58] var_1_23 = var_1_24 [L59] var_1_25 = var_1_23 [L60] var_1_26 = var_1_24 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L61] COND TRUE \read(var_1_28) [L62] var_1_27 = (((((var_1_29 - var_1_30)) < (var_1_31)) ? ((var_1_29 - var_1_30)) : (var_1_31))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] var_1_32 = var_1_30 [L65] var_1_33 = var_1_24 [L66] var_1_34 = var_1_24 [L67] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L73] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L74] COND TRUE last_1_var_1_14 >= stepLocal_3 [L75] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L77] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] COND TRUE (- var_1_14) > var_1_6 [L79] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L84] unsigned char stepLocal_2 = var_1_4; [L85] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=7516127216, stepLocal_2=0, var_1_10=65534, var_1_11=78/5, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=7516127216, var_1_10=65534, var_1_11=78/5, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L89] COND TRUE stepLocal_1 >= var_1_6 [L90] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L95] unsigned char stepLocal_5 = var_1_1; [L96] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=65534, var_1_11=78/5, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L97] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=65534, var_1_11=78/5, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L104] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=65534, var_1_11=78/5, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L105] COND TRUE ! var_1_1 [L106] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=65534, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L176] RET step() [L177] CALL, EXPR property() [L167-L168] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L177] RET, EXPR property() [L177] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_14=7516127216, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 10, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1798 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1767 mSDsluCounter, 3168 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1992 mSDsCounter, 1008 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2273 IncrementalHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1008 mSolverCounterUnsat, 1176 mSDtfsCounter, 2273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1461 GetRequests, 1324 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2050 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=518occurred in iteration=6, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 522 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 2815 NumberOfCodeBlocks, 2815 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2985 ConstructedInterpolants, 0 QuantifiedInterpolants, 14338 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1788 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 26855/27840 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 21:23:41,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_fillercodesize_ps-cn-10_file-4.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 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:23:43,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:23:43,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 21:23:43,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:23:43,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:23:43,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:23:43,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:23:43,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:23:43,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:23:43,716 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:23:43,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:23:43,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:23:43,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:23:43,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:23:43,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:23:43,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:23:43,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:23:43,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:23:43,718 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 -> 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 [2025-02-05 21:23:44,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:23:44,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:23:44,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:23:44,021 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:23:44,022 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:23:44,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2025-02-05 21:23:45,222 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e0fb85da/f7dff67a26314c1baf195a6c5640004d/FLAGbe27a6145 [2025-02-05 21:23:45,440 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:23:45,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2025-02-05 21:23:45,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e0fb85da/f7dff67a26314c1baf195a6c5640004d/FLAGbe27a6145 [2025-02-05 21:23:45,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e0fb85da/f7dff67a26314c1baf195a6c5640004d [2025-02-05 21:23:45,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:23:45,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:23:45,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:23:45,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:23:45,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:23:45,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:23:45" (1/1) ... [2025-02-05 21:23:45,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d75a94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:45, skipping insertion in model container [2025-02-05 21:23:45,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:23:45" (1/1) ... [2025-02-05 21:23:45,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:23:45,926 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_fillercodesize_ps-cn-10_file-4.i[914,927] [2025-02-05 21:23:45,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:23:45,976 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:23:45,986 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_fillercodesize_ps-cn-10_file-4.i[914,927] [2025-02-05 21:23:46,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:23:46,020 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:23:46,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46 WrapperNode [2025-02-05 21:23:46,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:23:46,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:23:46,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:23:46,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:23:46,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,064 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2025-02-05 21:23:46,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:23:46,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:23:46,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:23:46,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:23:46,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,092 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 21:23:46,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:23:46,113 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:23:46,113 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:23:46,113 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:23:46,114 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (1/1) ... [2025-02-05 21:23:46,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:23:46,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:23:46,138 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 21:23:46,143 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 21:23:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:23:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 21:23:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:23:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:23:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:23:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:23:46,233 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:23:46,234 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:23:46,813 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 21:23:46,813 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:23:46,824 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:23:46,824 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:23:46,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:23:46 BoogieIcfgContainer [2025-02-05 21:23:46,824 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:23:46,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:23:46,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:23:46,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:23:46,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:23:45" (1/3) ... [2025-02-05 21:23:46,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198f6142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:23:46, skipping insertion in model container [2025-02-05 21:23:46,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:23:46" (2/3) ... [2025-02-05 21:23:46,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198f6142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:23:46, skipping insertion in model container [2025-02-05 21:23:46,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:23:46" (3/3) ... [2025-02-05 21:23:46,839 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2025-02-05 21:23:46,853 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:23:46,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:23:46,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:23:46,909 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;@31195f21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:23:46,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:23:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 21:23:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-05 21:23:46,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:46,926 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:46,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:46,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1444461401, now seen corresponding path program 1 times [2025-02-05 21:23:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:23:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396408200] [2025-02-05 21:23:46,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:46,938 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 21:23:46,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:23:46,940 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 21:23:46,942 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 21:23:47,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 21:23:47,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 21:23:47,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:47,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:47,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:23:47,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:23:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2025-02-05 21:23:47,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:23:47,244 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:23:47,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396408200] [2025-02-05 21:23:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396408200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:23:47,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:23:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 21:23:47,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184855080] [2025-02-05 21:23:47,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:23:47,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:23:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:23:47,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:23:47,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:23:47,266 INFO L87 Difference]: Start difference. First operand has 80 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 21:23:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:47,290 INFO L93 Difference]: Finished difference Result 154 states and 271 transitions. [2025-02-05 21:23:47,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:23:47,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 186 [2025-02-05 21:23:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:47,296 INFO L225 Difference]: With dead ends: 154 [2025-02-05 21:23:47,299 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 21:23:47,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 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 21:23:47,305 INFO L435 NwaCegarLoop]: 117 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, 117 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 21:23:47,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:23:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 21:23:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-05 21:23:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 21:23:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-02-05 21:23:47,334 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 186 [2025-02-05 21:23:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:47,334 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-02-05 21:23:47,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 21:23:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-02-05 21:23:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 21:23:47,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:47,340 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:47,355 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 21:23:47,540 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 21:23:47,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:47,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash -737942386, now seen corresponding path program 1 times [2025-02-05 21:23:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:23:47,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584945327] [2025-02-05 21:23:47,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:47,543 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 21:23:47,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:23:47,545 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 21:23:47,546 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 21:23:47,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 21:23:47,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 21:23:47,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:47,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:47,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 21:23:47,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:23:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 279 proven. 159 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2025-02-05 21:23:48,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:23:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 162 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2025-02-05 21:23:48,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:23:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584945327] [2025-02-05 21:23:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584945327] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:23:48,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:23:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-02-05 21:23:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433919705] [2025-02-05 21:23:48,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 21:23:48,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:23:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:23:48,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:23:48,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:23:48,877 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-02-05 21:23:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:49,751 INFO L93 Difference]: Finished difference Result 177 states and 256 transitions. [2025-02-05 21:23:49,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 21:23:49,751 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 187 [2025-02-05 21:23:49,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:49,753 INFO L225 Difference]: With dead ends: 177 [2025-02-05 21:23:49,753 INFO L226 Difference]: Without dead ends: 103 [2025-02-05 21:23:49,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 359 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2025-02-05 21:23:49,754 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 171 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:49,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 255 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:23:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-05 21:23:49,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2025-02-05 21:23:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 21:23:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2025-02-05 21:23:49,773 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 187 [2025-02-05 21:23:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:49,773 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2025-02-05 21:23:49,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-02-05 21:23:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2025-02-05 21:23:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 21:23:49,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:49,775 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:49,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 21:23:49,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:23:49,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:49,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash -226129353, now seen corresponding path program 1 times [2025-02-05 21:23:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:23:49,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056350616] [2025-02-05 21:23:49,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:49,981 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 21:23:49,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:23:49,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:23:49,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 21:23:50,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:50,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:50,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:50,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:50,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 21:23:50,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:23:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 21:23:50,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:23:50,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:23:50,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056350616] [2025-02-05 21:23:50,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056350616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:23:50,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:23:50,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:23:50,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201988470] [2025-02-05 21:23:50,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:23:50,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:23:50,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:23:50,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:23:50,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:23:50,442 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:50,995 INFO L93 Difference]: Finished difference Result 254 states and 353 transitions. [2025-02-05 21:23:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:23:50,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2025-02-05 21:23:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:50,998 INFO L225 Difference]: With dead ends: 254 [2025-02-05 21:23:50,998 INFO L226 Difference]: Without dead ends: 168 [2025-02-05 21:23:50,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:23:50,999 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 132 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:50,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 292 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:23:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-05 21:23:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2025-02-05 21:23:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 99 states have internal predecessors, (110), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 21:23:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2025-02-05 21:23:51,024 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 188 [2025-02-05 21:23:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:51,024 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2025-02-05 21:23:51,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2025-02-05 21:23:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 21:23:51,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:51,026 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:51,045 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 (4)] Ended with exit code 0 [2025-02-05 21:23:51,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 21:23:51,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:51,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2033583816, now seen corresponding path program 1 times [2025-02-05 21:23:51,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:23:51,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799779273] [2025-02-05 21:23:51,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:51,228 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 21:23:51,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:23:51,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:23:51,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 21:23:51,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:51,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:51,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:51,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:51,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:23:51,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:23:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 717 proven. 63 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2025-02-05 21:23:52,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:23:52,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:23:52,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799779273] [2025-02-05 21:23:52,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799779273] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:23:52,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1676408783] [2025-02-05 21:23:52,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:52,406 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 21:23:52,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 21:23:52,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 21:23:52,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-05 21:23:52,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:52,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:52,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:52,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:52,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 21:23:52,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:23:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 818 proven. 117 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-02-05 21:23:53,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:23:54,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1676408783] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:23:54,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:23:54,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2025-02-05 21:23:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546188690] [2025-02-05 21:23:54,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 21:23:54,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 21:23:54,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:23:54,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 21:23:54,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-02-05 21:23:54,111 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2025-02-05 21:23:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:57,274 INFO L93 Difference]: Finished difference Result 451 states and 605 transitions. [2025-02-05 21:23:57,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 21:23:57,275 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) Word has length 188 [2025-02-05 21:23:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:57,278 INFO L225 Difference]: With dead ends: 451 [2025-02-05 21:23:57,278 INFO L226 Difference]: Without dead ends: 288 [2025-02-05 21:23:57,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 21:23:57,279 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 277 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:57,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 467 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 21:23:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-05 21:23:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2025-02-05 21:23:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 162 states have (on average 1.0925925925925926) internal successors, (177), 162 states have internal predecessors, (177), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 21:23:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2025-02-05 21:23:57,309 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 188 [2025-02-05 21:23:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:57,309 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2025-02-05 21:23:57,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2025-02-05 21:23:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2025-02-05 21:23:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 21:23:57,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:57,311 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:57,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-02-05 21:23:57,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-05 21:23:57,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:23:57,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:57,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1967980473, now seen corresponding path program 1 times [2025-02-05 21:23:57,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:23:57,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253841546] [2025-02-05 21:23:57,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:57,713 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 21:23:57,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:23:57,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:23:57,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-05 21:23:57,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:23:57,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:23:57,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:57,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:57,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:23:57,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:23:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 21:23:58,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:23:58,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:23:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253841546] [2025-02-05 21:23:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253841546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:23:58,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:23:58,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:23:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713888089] [2025-02-05 21:23:58,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:23:58,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:23:58,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:23:58,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:23:58,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:23:58,405 INFO L87 Difference]: Start difference. First operand 268 states and 357 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:23:59,010 INFO L93 Difference]: Finished difference Result 445 states and 590 transitions. [2025-02-05 21:23:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:23:59,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2025-02-05 21:23:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:23:59,021 INFO L225 Difference]: With dead ends: 445 [2025-02-05 21:23:59,021 INFO L226 Difference]: Without dead ends: 180 [2025-02-05 21:23:59,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:23:59,022 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:23:59,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 334 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:23:59,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-05 21:23:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2025-02-05 21:23:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 21:23:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 218 transitions. [2025-02-05 21:23:59,044 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 218 transitions. Word has length 188 [2025-02-05 21:23:59,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:23:59,045 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 218 transitions. [2025-02-05 21:23:59,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 21:23:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2025-02-05 21:23:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 21:23:59,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:23:59,046 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:23:59,053 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 (7)] Ended with exit code 0 [2025-02-05 21:23:59,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 21:23:59,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:23:59,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:23:59,247 INFO L85 PathProgramCache]: Analyzing trace with hash 990414640, now seen corresponding path program 1 times [2025-02-05 21:23:59,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:23:59,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885762430] [2025-02-05 21:23:59,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:23:59,248 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 21:23:59,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:23:59,250 INFO L229 MonitoredProcess]: Starting monitored process 8 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 21:23:59,251 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 (8)] Waiting until timeout for monitored process [2025-02-05 21:23:59,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 21:23:59,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 21:23:59,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:23:59,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:23:59,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 21:23:59,427 INFO L279 TraceCheckSpWp]: Computing forward predicates...