./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.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 b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:50:10,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:50:10,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:50:10,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:50:10,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:50:10,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:50:10,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:50:10,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:50:10,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:50:10,419 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:50:10,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:50:10,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:50:10,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:50:10,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:50:10,421 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:50:10,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:50:10,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:50:10,421 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:50:10,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:50:10,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:50:10,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:50:10,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:50:10,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:50:10,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:50:10,422 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:50:10,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:50:10,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:50:10,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:50:10,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:50:10,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:50:10,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:50:10,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:50:10,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:50:10,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:50:10,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:50:10,424 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:50:10,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:50:10,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:50:10,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:50:10,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:50:10,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:50:10,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:50:10,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:50:10,425 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 -> b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 [2025-02-05 20:50:10,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:50:10,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:50:10,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:50:10,727 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:50:10,728 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:50:10,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2025-02-05 20:50:11,983 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed0d44118/72b1ec7496104fb493c1891f547f4dfa/FLAG3255e0ab9 [2025-02-05 20:50:12,280 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:50:12,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2025-02-05 20:50:12,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed0d44118/72b1ec7496104fb493c1891f547f4dfa/FLAG3255e0ab9 [2025-02-05 20:50:12,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed0d44118/72b1ec7496104fb493c1891f547f4dfa [2025-02-05 20:50:12,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:50:12,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:50:12,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:50:12,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:50:12,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:50:12,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78df33a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12, skipping insertion in model container [2025-02-05 20:50:12,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:50:12,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i[917,930] [2025-02-05 20:50:12,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:50:12,811 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:50:12,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i[917,930] [2025-02-05 20:50:12,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:50:12,879 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:50:12,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12 WrapperNode [2025-02-05 20:50:12,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:50:12,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:50:12,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:50:12,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:50:12,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,932 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-02-05 20:50:12,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:50:12,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:50:12,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:50:12,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:50:12,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,969 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:50:12,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,977 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:12,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:50:12,996 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:50:12,996 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:50:12,996 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:50:12,997 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (1/1) ... [2025-02-05 20:50:13,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:50:13,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:50:13,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:50:13,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:50:13,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:50:13,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:50:13,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:50:13,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:50:13,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:50:13,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:50:13,154 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:50:13,157 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:50:13,473 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L160: havoc property_#t~bitwise27#1;havoc property_#t~bitwise28#1;havoc property_#t~short29#1; [2025-02-05 20:50:13,521 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 20:50:13,521 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:50:13,545 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:50:13,546 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:50:13,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:50:13 BoogieIcfgContainer [2025-02-05 20:50:13,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:50:13,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:50:13,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:50:13,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:50:13,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:50:12" (1/3) ... [2025-02-05 20:50:13,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4d2058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:50:13, skipping insertion in model container [2025-02-05 20:50:13,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:12" (2/3) ... [2025-02-05 20:50:13,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4d2058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:50:13, skipping insertion in model container [2025-02-05 20:50:13,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:50:13" (3/3) ... [2025-02-05 20:50:13,558 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-63.i [2025-02-05 20:50:13,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:50:13,579 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-63.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:50:13,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:50:13,655 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;@58d4354b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:50:13,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:50:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 64 states have internal predecessors, (83), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:50:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 20:50:13,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:13,677 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:13,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:13,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash 218047319, now seen corresponding path program 1 times [2025-02-05 20:50:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:50:13,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518587880] [2025-02-05 20:50:13,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:50:13,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 20:50:13,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 20:50:13,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:13,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2025-02-05 20:50:14,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:50:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518587880] [2025-02-05 20:50:14,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518587880] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:50:14,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559204828] [2025-02-05 20:50:14,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:14,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:50:14,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:50:14,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:50:14,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:50:14,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 20:50:14,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 20:50:14,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:14,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:14,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:50:14,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:50:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2025-02-05 20:50:14,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:50:14,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559204828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:50:14,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:50:14,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:50:14,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089857145] [2025-02-05 20:50:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:50:14,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:50:14,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:50:14,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:50:14,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:50:14,392 INFO L87 Difference]: Start difference. First operand has 102 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 64 states have internal predecessors, (83), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2025-02-05 20:50:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:50:14,426 INFO L93 Difference]: Finished difference Result 198 states and 341 transitions. [2025-02-05 20:50:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:50:14,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 227 [2025-02-05 20:50:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:50:14,435 INFO L225 Difference]: With dead ends: 198 [2025-02-05 20:50:14,435 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 20:50:14,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:50:14,442 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:50:14,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:50:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 20:50:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-05 20:50:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:50:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 150 transitions. [2025-02-05 20:50:14,501 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 150 transitions. Word has length 227 [2025-02-05 20:50:14,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:50:14,502 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 150 transitions. [2025-02-05 20:50:14,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2025-02-05 20:50:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 150 transitions. [2025-02-05 20:50:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 20:50:14,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:14,510 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:14,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:50:14,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:50:14,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:14,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:14,712 INFO L85 PathProgramCache]: Analyzing trace with hash 542261745, now seen corresponding path program 1 times [2025-02-05 20:50:14,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:50:14,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245100125] [2025-02-05 20:50:14,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:14,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:50:14,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 20:50:14,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 20:50:14,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:14,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-02-05 20:50:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:50:15,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245100125] [2025-02-05 20:50:15,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245100125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:50:15,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:50:15,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:50:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411362108] [2025-02-05 20:50:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:50:15,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:50:15,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:50:15,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:50:15,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:50:15,021 INFO L87 Difference]: Start difference. First operand 99 states and 150 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:50:15,110 INFO L93 Difference]: Finished difference Result 243 states and 365 transitions. [2025-02-05 20:50:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:50:15,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2025-02-05 20:50:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:50:15,115 INFO L225 Difference]: With dead ends: 243 [2025-02-05 20:50:15,117 INFO L226 Difference]: Without dead ends: 147 [2025-02-05 20:50:15,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:50:15,119 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 63 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:50:15,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 314 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:50:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-05 20:50:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2025-02-05 20:50:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 96 states have internal predecessors, (121), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 20:50:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2025-02-05 20:50:15,153 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 227 [2025-02-05 20:50:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:50:15,153 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2025-02-05 20:50:15,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2025-02-05 20:50:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 20:50:15,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:15,163 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:15,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:50:15,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:15,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash 36703120, now seen corresponding path program 1 times [2025-02-05 20:50:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:50:15,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801749412] [2025-02-05 20:50:15,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:50:15,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 20:50:15,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 20:50:15,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:15,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-02-05 20:50:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:50:15,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801749412] [2025-02-05 20:50:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801749412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:50:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:50:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:50:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571402826] [2025-02-05 20:50:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:50:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:50:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:50:15,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:50:15,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:50:15,402 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:50:15,471 INFO L93 Difference]: Finished difference Result 299 states and 439 transitions. [2025-02-05 20:50:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:50:15,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2025-02-05 20:50:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:50:15,477 INFO L225 Difference]: With dead ends: 299 [2025-02-05 20:50:15,479 INFO L226 Difference]: Without dead ends: 158 [2025-02-05 20:50:15,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:50:15,481 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 62 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:50:15,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 282 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:50:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-05 20:50:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2025-02-05 20:50:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:50:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2025-02-05 20:50:15,500 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 227 [2025-02-05 20:50:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:50:15,501 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2025-02-05 20:50:15,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2025-02-05 20:50:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 20:50:15,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:15,507 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:15,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:50:15,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:15,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash -159810385, now seen corresponding path program 1 times [2025-02-05 20:50:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:50:15,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73550450] [2025-02-05 20:50:15,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:15,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:50:15,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 20:50:15,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 20:50:15,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:15,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-02-05 20:50:16,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:50:16,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73550450] [2025-02-05 20:50:16,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73550450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:50:16,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:50:16,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:50:16,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043146773] [2025-02-05 20:50:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:50:16,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:50:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:50:16,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:50:16,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:50:16,705 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:50:16,955 INFO L93 Difference]: Finished difference Result 281 states and 404 transitions. [2025-02-05 20:50:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:50:16,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2025-02-05 20:50:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:50:16,960 INFO L225 Difference]: With dead ends: 281 [2025-02-05 20:50:16,960 INFO L226 Difference]: Without dead ends: 163 [2025-02-05 20:50:16,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:50:16,963 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 35 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:50:16,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 930 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:50:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-05 20:50:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2025-02-05 20:50:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 118 states have (on average 1.2796610169491525) internal successors, (151), 119 states have internal predecessors, (151), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 20:50:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 227 transitions. [2025-02-05 20:50:16,995 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 227 transitions. Word has length 227 [2025-02-05 20:50:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:50:16,996 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 227 transitions. [2025-02-05 20:50:16,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 227 transitions. [2025-02-05 20:50:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 20:50:17,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:17,000 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:17,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:50:17,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash 461473621, now seen corresponding path program 1 times [2025-02-05 20:50:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:50:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326655631] [2025-02-05 20:50:17,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:17,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:50:17,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 20:50:17,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 20:50:17,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:17,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-02-05 20:50:17,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:50:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326655631] [2025-02-05 20:50:17,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326655631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:50:17,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:50:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:50:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999924219] [2025-02-05 20:50:17,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:50:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:50:17,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:50:17,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:50:17,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:50:17,805 INFO L87 Difference]: Start difference. First operand 160 states and 227 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:50:18,188 INFO L93 Difference]: Finished difference Result 405 states and 566 transitions. [2025-02-05 20:50:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:50:18,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2025-02-05 20:50:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:50:18,197 INFO L225 Difference]: With dead ends: 405 [2025-02-05 20:50:18,197 INFO L226 Difference]: Without dead ends: 248 [2025-02-05 20:50:18,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:50:18,200 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 88 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:50:18,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 851 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:50:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-05 20:50:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 206. [2025-02-05 20:50:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.3231707317073171) internal successors, (217), 165 states have internal predecessors, (217), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 20:50:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 293 transitions. [2025-02-05 20:50:18,229 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 293 transitions. Word has length 228 [2025-02-05 20:50:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:50:18,232 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 293 transitions. [2025-02-05 20:50:18,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 293 transitions. [2025-02-05 20:50:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 20:50:18,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:18,235 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:18,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:50:18,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:18,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:18,236 INFO L85 PathProgramCache]: Analyzing trace with hash -307347181, now seen corresponding path program 1 times [2025-02-05 20:50:18,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:50:18,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504214523] [2025-02-05 20:50:18,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:18,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:50:18,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 20:50:18,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 20:50:18,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:18,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-02-05 20:50:18,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:50:18,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504214523] [2025-02-05 20:50:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504214523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:50:18,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:50:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:50:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24157922] [2025-02-05 20:50:18,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:50:18,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:50:18,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:50:18,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:50:18,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:50:18,369 INFO L87 Difference]: Start difference. First operand 206 states and 293 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:50:18,426 INFO L93 Difference]: Finished difference Result 454 states and 642 transitions. [2025-02-05 20:50:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:50:18,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2025-02-05 20:50:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:50:18,429 INFO L225 Difference]: With dead ends: 454 [2025-02-05 20:50:18,429 INFO L226 Difference]: Without dead ends: 251 [2025-02-05 20:50:18,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:50:18,431 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 34 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:50:18,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 305 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:50:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-05 20:50:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 229. [2025-02-05 20:50:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 187 states have (on average 1.3262032085561497) internal successors, (248), 188 states have internal predecessors, (248), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 20:50:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 324 transitions. [2025-02-05 20:50:18,455 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 324 transitions. Word has length 228 [2025-02-05 20:50:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:50:18,457 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 324 transitions. [2025-02-05 20:50:18,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 324 transitions. [2025-02-05 20:50:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 20:50:18,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:18,461 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:18,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:50:18,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:18,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash 214643437, now seen corresponding path program 1 times [2025-02-05 20:50:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:50:18,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18609716] [2025-02-05 20:50:18,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:50:18,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 20:50:18,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 20:50:18,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:18,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:50:18,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:50:18,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 20:50:18,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 20:50:18,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:18,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:50:18,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:50:18,808 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:50:18,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:50:18,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:50:18,815 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:18,970 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:50:18,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:50:18 BoogieIcfgContainer [2025-02-05 20:50:18,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:50:18,975 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:50:18,975 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:50:18,976 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:50:18,976 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:50:13" (3/4) ... [2025-02-05 20:50:18,979 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:50:18,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:50:18,981 INFO L158 Benchmark]: Toolchain (without parser) took 6425.03ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 123.7MB in the beginning and 158.7MB in the end (delta: -35.0MB). Peak memory consumption was 178.7MB. Max. memory is 16.1GB. [2025-02-05 20:50:18,982 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:50:18,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.19ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 108.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:50:18,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.29ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 105.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:50:18,982 INFO L158 Benchmark]: Boogie Preprocessor took 61.93ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 102.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:50:18,982 INFO L158 Benchmark]: IcfgBuilder took 551.36ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 76.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:50:18,983 INFO L158 Benchmark]: TraceAbstraction took 5425.48ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 75.9MB in the beginning and 158.8MB in the end (delta: -82.9MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2025-02-05 20:50:18,983 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 385.9MB. Free memory was 158.8MB in the beginning and 158.7MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:50:18,984 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.33ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.19ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 108.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.29ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 105.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.93ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 102.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 551.36ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 76.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5425.48ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 75.9MB in the beginning and 158.8MB in the end (delta: -82.9MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 385.9MB. Free memory was 158.8MB in the beginning and 158.7MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someBinaryDOUBLEComparisonOperation at line 138. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned long int var_1_2 = 50; [L24] unsigned long int var_1_3 = 8; [L25] signed long int var_1_4 = 25; [L26] signed long int var_1_5 = -100; [L27] signed long int var_1_6 = 8; [L28] unsigned char var_1_7 = 0; [L29] signed long int var_1_8 = 128; [L30] signed long int var_1_9 = 2; [L31] signed long int var_1_10 = 128; [L32] unsigned short int var_1_11 = 500; [L33] unsigned short int var_1_12 = 128; [L34] unsigned char var_1_13 = 64; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 8; [L37] double var_1_17 = 7.5; [L38] double var_1_18 = 31.125; [L39] double var_1_19 = 10.5; [L40] double var_1_20 = 0.0; [L41] double var_1_21 = 16.75; [L42] double var_1_22 = 2.5; [L43] double var_1_23 = 64.5; [L44] signed long int var_1_24 = 10; [L45] signed long int var_1_25 = -64; [L46] signed char var_1_26 = 16; [L47] signed char var_1_27 = 4; [L48] signed char var_1_28 = -10; [L49] float var_1_29 = 63.794; [L50] unsigned short int var_1_30 = 1; [L51] signed long int var_1_31 = -2; [L52] unsigned char var_1_32 = 64; VAL [isInitial=0, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_2=50, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] FCALL updateLastVariables() [L168] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L101] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L102] var_1_3 = __VERIFIER_nondet_ulong() [L103] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L103] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L104] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L105] var_1_4 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L106] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L107] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L107] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L108] var_1_5 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_5 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L109] RET assume_abort_if_not(var_1_5 >= -536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L110] CALL assume_abort_if_not(var_1_5 <= 536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L110] RET assume_abort_if_not(var_1_5 <= 536870912) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L111] var_1_6 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_6 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=128, var_1_9=2] [L112] RET assume_abort_if_not(var_1_6 >= -536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=128, var_1_9=2] [L113] CALL assume_abort_if_not(var_1_6 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=128, var_1_9=2] [L113] RET assume_abort_if_not(var_1_6 <= 536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=128, var_1_9=2] [L114] var_1_7 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_8=128, var_1_9=2] [L115] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_8=128, var_1_9=2] [L116] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=128, var_1_9=2] [L116] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=128, var_1_9=2] [L117] var_1_8 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=2] [L118] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=2] [L119] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=2] [L119] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=2] [L120] var_1_9 = __VERIFIER_nondet_long() [L121] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L121] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L122] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L123] var_1_10 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L124] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L125] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L125] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L126] var_1_12 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L127] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L128] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L128] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L129] var_1_15 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L131] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L132] var_1_16 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L133] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L134] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L134] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L135] var_1_18 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L136] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L137] var_1_19 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L138] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L139] var_1_20 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L140] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L141] var_1_21 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L142] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L143] var_1_22 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L144] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L145] var_1_23 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L146] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L147] var_1_25 = __VERIFIER_nondet_long() [L148] CALL assume_abort_if_not(var_1_25 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L148] RET assume_abort_if_not(var_1_25 >= -2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_25 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L149] RET assume_abort_if_not(var_1_25 <= 2147483646) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L150] var_1_27 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L152] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L153] var_1_28 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L154] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L155] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L168] RET updateVariables() [L169] CALL step() [L56] EXPR (var_1_2 + 4u) | var_1_3 VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L56] COND TRUE 32u < ((var_1_2 + 4u) | var_1_3) [L57] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=1, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L65] EXPR var_1_9 >> var_1_4 VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=1, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L65] signed long int stepLocal_0 = var_1_9 >> var_1_4; [L66] COND TRUE stepLocal_0 < var_1_1 [L67] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=1, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L69] unsigned short int stepLocal_1 = var_1_11; VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=1, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L70] COND TRUE var_1_2 != stepLocal_1 [L71] var_1_13 = ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))) VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=15/2, var_1_1=1, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L73] COND FALSE !(\read(var_1_7)) [L76] var_1_17 = var_1_22 VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L78] signed long int stepLocal_2 = var_1_10; VAL [isInitial=1, stepLocal_2=2147483646, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=10, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L79] COND TRUE ! var_1_7 [L80] var_1_24 = (var_1_11 - ((((((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) < ((var_1_13 + var_1_15))) ? (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) : ((var_1_13 + var_1_15))))) VAL [isInitial=1, stepLocal_2=2147483646, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=0, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L88] COND FALSE !(var_1_8 >= var_1_1) VAL [isInitial=1, stepLocal_2=2147483646, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=0, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L91] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, stepLocal_2=2147483646, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=0, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L94] var_1_30 = var_1_12 [L95] var_1_31 = var_1_25 [L96] var_1_32 = var_1_16 VAL [isInitial=1, stepLocal_2=2147483646, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=0, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=0, var_1_31=1, var_1_32=4, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L169] RET step() [L170] CALL, EXPR property() [L160] EXPR (var_1_2 + 4u) | var_1_3 VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=0, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=0, var_1_31=1, var_1_32=4, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L160] EXPR ((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1) VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=0, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=0, var_1_31=1, var_1_32=4, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L160] EXPR var_1_9 >> var_1_4 VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=0, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=0, var_1_31=1, var_1_32=4, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L160] EXPR ((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1) VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=0, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=0, var_1_31=1, var_1_32=4, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L160-L161] return ((((((((((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1)) && ((var_1_2 != var_1_11) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) < ((var_1_13 + var_1_15))) ? (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) : ((var_1_13 + var_1_15))))))) : ((var_1_10 < var_1_9) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_25))))) && ((var_1_8 >= var_1_1) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_12))) && (var_1_31 == ((signed long int) var_1_25))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=0, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=0, var_1_31=1, var_1_32=4, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=4, var_1_17=2147483651, var_1_1=1, var_1_22=2147483651, var_1_24=0, var_1_25=1, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_2=-4, var_1_30=0, var_1_31=1, var_1_32=4, var_1_3=-1, var_1_4=0, var_1_5=536870912, var_1_6=-536870911, var_1_7=0, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 7, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 282 mSDsluCounter, 2828 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1855 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 573 IncrementalHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 973 mSDtfsCounter, 573 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=6, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 107 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1820 NumberOfCodeBlocks, 1820 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 2496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 17570/17640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 20:50:19,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.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 b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:50:21,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:50:21,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:50:21,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:50:21,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:50:21,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:50:21,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:50:21,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:50:21,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:50:21,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:50:21,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:50:21,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:50:21,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:50:21,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:50:21,436 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:50:21,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:50:21,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:50:21,436 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:50:21,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:50:21,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:50:21,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:50:21,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:50:21,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:50:21,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:50:21,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:50:21,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:50:21,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:50:21,440 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:50:21,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:50:21,440 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:50:21,440 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:50:21,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:50:21,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:50:21,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:50:21,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:50:21,441 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 -> b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 [2025-02-05 20:50:21,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:50:21,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:50:21,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:50:21,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:50:21,757 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:50:21,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2025-02-05 20:50:23,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/783ee0575/6864a4c28bca4a7ea1f81384a77ee915/FLAGe8d8ab08e [2025-02-05 20:50:23,402 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:50:23,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2025-02-05 20:50:23,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/783ee0575/6864a4c28bca4a7ea1f81384a77ee915/FLAGe8d8ab08e [2025-02-05 20:50:23,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/783ee0575/6864a4c28bca4a7ea1f81384a77ee915 [2025-02-05 20:50:23,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:50:23,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:50:23,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:50:23,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:50:23,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:50:23,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:50:23" (1/1) ... [2025-02-05 20:50:23,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3248785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:23, skipping insertion in model container [2025-02-05 20:50:23,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:50:23" (1/1) ... [2025-02-05 20:50:23,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:50:23,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i[917,930] [2025-02-05 20:50:23,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:50:23,959 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:50:23,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i[917,930] [2025-02-05 20:50:24,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:50:24,016 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:50:24,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24 WrapperNode [2025-02-05 20:50:24,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:50:24,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:50:24,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:50:24,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:50:24,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,052 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2025-02-05 20:50:24,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:50:24,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:50:24,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:50:24,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:50:24,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,086 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:50:24,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,094 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:50:24,101 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:50:24,101 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:50:24,102 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:50:24,102 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (1/1) ... [2025-02-05 20:50:24,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:50:24,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:50:24,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:50:24,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:50:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:50:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:50:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:50:24,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:50:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:50:24,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:50:24,238 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:50:24,240 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:50:30,871 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 20:50:30,871 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:50:30,882 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:50:30,882 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:50:30,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:50:30 BoogieIcfgContainer [2025-02-05 20:50:30,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:50:30,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:50:30,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:50:30,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:50:30,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:50:23" (1/3) ... [2025-02-05 20:50:30,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f92451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:50:30, skipping insertion in model container [2025-02-05 20:50:30,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:50:24" (2/3) ... [2025-02-05 20:50:30,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f92451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:50:30, skipping insertion in model container [2025-02-05 20:50:30,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:50:30" (3/3) ... [2025-02-05 20:50:30,894 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-63.i [2025-02-05 20:50:30,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:50:30,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-63.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:50:30,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:50:30,961 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;@193f8174, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:50:30,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:50:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:50:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 20:50:30,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:30,978 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:30,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:30,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:30,983 INFO L85 PathProgramCache]: Analyzing trace with hash 182957515, now seen corresponding path program 1 times [2025-02-05 20:50:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:50:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050164524] [2025-02-05 20:50:30,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:30,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:50:30,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:50:30,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:50:30,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 20:50:31,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 20:50:31,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 20:50:31,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:31,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:31,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:50:31,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:50:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2025-02-05 20:50:31,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:50:31,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:50:31,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050164524] [2025-02-05 20:50:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050164524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:50:31,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:50:31,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:50:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464075603] [2025-02-05 20:50:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:50:31,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:50:31,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:50:31,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:50:31,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:50:31,528 INFO L87 Difference]: Start difference. First operand has 88 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-02-05 20:50:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:50:31,551 INFO L93 Difference]: Finished difference Result 170 states and 299 transitions. [2025-02-05 20:50:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:50:31,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 221 [2025-02-05 20:50:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:50:31,559 INFO L225 Difference]: With dead ends: 170 [2025-02-05 20:50:31,559 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 20:50:31,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:50:31,565 INFO L435 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:50:31,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:50:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 20:50:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-05 20:50:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:50:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 129 transitions. [2025-02-05 20:50:31,604 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 129 transitions. Word has length 221 [2025-02-05 20:50:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:50:31,604 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 129 transitions. [2025-02-05 20:50:31,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-02-05 20:50:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 129 transitions. [2025-02-05 20:50:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 20:50:31,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:31,609 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:31,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 20:50:31,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:50:31,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:31,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1748258789, now seen corresponding path program 1 times [2025-02-05 20:50:31,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:50:31,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757134371] [2025-02-05 20:50:31,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:31,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:50:31,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:50:31,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:50:31,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 20:50:31,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 20:50:32,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 20:50:32,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:32,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:32,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 20:50:32,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:50:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-02-05 20:50:32,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:50:32,306 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:50:32,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757134371] [2025-02-05 20:50:32,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757134371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:50:32,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:50:32,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:50:32,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030843637] [2025-02-05 20:50:32,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:50:32,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:50:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:50:32,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:50:32,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:50:32,311 INFO L87 Difference]: Start difference. First operand 85 states and 129 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:35,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:50:39,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:50:42,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:50:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:50:42,574 INFO L93 Difference]: Finished difference Result 204 states and 307 transitions. [2025-02-05 20:50:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:50:42,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 221 [2025-02-05 20:50:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:50:42,603 INFO L225 Difference]: With dead ends: 204 [2025-02-05 20:50:42,603 INFO L226 Difference]: Without dead ends: 122 [2025-02-05 20:50:42,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:50:42,604 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 47 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:50:42,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2025-02-05 20:50:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-05 20:50:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2025-02-05 20:50:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 20:50:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2025-02-05 20:50:42,629 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 221 [2025-02-05 20:50:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:50:42,629 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2025-02-05 20:50:42,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2025-02-05 20:50:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 20:50:42,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:42,635 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:42,651 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-05 20:50:42,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:50:42,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:42,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:42,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1776887940, now seen corresponding path program 1 times [2025-02-05 20:50:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:50:42,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224643452] [2025-02-05 20:50:42,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:42,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:50:42,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:50:42,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:50:42,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 20:50:42,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 20:50:43,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 20:50:43,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:43,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:43,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 20:50:43,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:50:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-02-05 20:50:43,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:50:43,251 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:50:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224643452] [2025-02-05 20:50:43,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224643452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:50:43,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:50:43,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:50:43,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445239803] [2025-02-05 20:50:43,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:50:43,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:50:43,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:50:43,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:50:43,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:50:43,254 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:46,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:50:50,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:50:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:50:50,294 INFO L93 Difference]: Finished difference Result 247 states and 362 transitions. [2025-02-05 20:50:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:50:50,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 221 [2025-02-05 20:50:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:50:50,296 INFO L225 Difference]: With dead ends: 247 [2025-02-05 20:50:50,297 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 20:50:50,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:50:50,298 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 48 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:50:50,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 285 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2025-02-05 20:50:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 20:50:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2025-02-05 20:50:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 20:50:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2025-02-05 20:50:50,317 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 221 [2025-02-05 20:50:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:50:50,317 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2025-02-05 20:50:50,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 20:50:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2025-02-05 20:50:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 20:50:50,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:50:50,320 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:50:50,337 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 20:50:50,522 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 20:50:50,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:50:50,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:50:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1580374435, now seen corresponding path program 1 times [2025-02-05 20:50:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:50:50,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084833744] [2025-02-05 20:50:50,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:50:50,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:50:50,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:50:50,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:50:50,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 20:50:50,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 20:50:50,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 20:50:50,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:50:50,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:50:50,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 20:50:50,963 INFO L279 TraceCheckSpWp]: Computing forward predicates...