./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.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 f51329798d39553bfe6698070ebd1150c84493b84ecd2c17e90b69fb6b7c2e13 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:49:53,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:49:53,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:49:53,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:49:53,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:49:53,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:49:53,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:49:53,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:49:53,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:49:53,185 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:49:53,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:49:53,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:49:53,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:49:53,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:49:53,186 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:49:53,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:49:53,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:49:53,187 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:49:53,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:49:53,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:49:53,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:49:53,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:49:53,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:49:53,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:49:53,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:49:53,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:49:53,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:49:53,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:49:53,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:49:53,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:49:53,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:49:53,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:49:53,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:49:53,190 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 -> f51329798d39553bfe6698070ebd1150c84493b84ecd2c17e90b69fb6b7c2e13 [2025-02-05 21:49:53,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:49:53,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:49:53,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:49:53,430 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:49:53,430 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:49:53,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2025-02-05 21:49:54,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4af7cee1a/d6c475d0b03b48e38486621fca21c3b0/FLAG8da8d87b8 [2025-02-05 21:49:54,847 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:49:54,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2025-02-05 21:49:54,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4af7cee1a/d6c475d0b03b48e38486621fca21c3b0/FLAG8da8d87b8 [2025-02-05 21:49:55,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4af7cee1a/d6c475d0b03b48e38486621fca21c3b0 [2025-02-05 21:49:55,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:49:55,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:49:55,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:49:55,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:49:55,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:49:55,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0d180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55, skipping insertion in model container [2025-02-05 21:49:55,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:49:55,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i[915,928] [2025-02-05 21:49:55,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:49:55,409 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:49:55,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i[915,928] [2025-02-05 21:49:55,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:49:55,466 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:49:55,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55 WrapperNode [2025-02-05 21:49:55,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:49:55,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:49:55,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:49:55,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:49:55,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,514 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-02-05 21:49:55,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:49:55,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:49:55,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:49:55,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:49:55,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:49:55,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:49:55,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:49:55,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:49:55,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:49:55,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (1/1) ... [2025-02-05 21:49:55,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:49:55,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:49:55,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:49:55,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:49:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:49:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:49:55,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:49:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:49:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:49:55,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:49:55,671 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:49:55,672 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:49:55,912 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 21:49:55,913 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:49:55,919 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:49:55,919 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:49:55,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:49:55 BoogieIcfgContainer [2025-02-05 21:49:55,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:49:55,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:49:55,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:49:55,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:49:55,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:49:55" (1/3) ... [2025-02-05 21:49:55,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e76354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:49:55, skipping insertion in model container [2025-02-05 21:49:55,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:49:55" (2/3) ... [2025-02-05 21:49:55,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e76354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:49:55, skipping insertion in model container [2025-02-05 21:49:55,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:49:55" (3/3) ... [2025-02-05 21:49:55,926 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2025-02-05 21:49:55,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:49:55,937 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-66.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:49:55,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:49:55,992 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;@2f323cba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:49:55,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:49:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 21:49:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:49:56,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:49:56,008 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:49:56,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:49:56,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:49:56,013 INFO L85 PathProgramCache]: Analyzing trace with hash 373431220, now seen corresponding path program 1 times [2025-02-05 21:49:56,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:49:56,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927006369] [2025-02-05 21:49:56,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:49:56,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:49:56,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:49:56,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:49:56,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:49:56,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:49:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-02-05 21:49:56,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:49:56,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927006369] [2025-02-05 21:49:56,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927006369] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:49:56,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244802362] [2025-02-05 21:49:56,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:49:56,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:49:56,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:49:56,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:49:56,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:49:56,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:49:56,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:49:56,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:49:56,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:49:56,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:49:56,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:49:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-02-05 21:49:56,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:49:56,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244802362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:49:56,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:49:56,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:49:56,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119309271] [2025-02-05 21:49:56,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:49:56,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:49:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:49:56,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:49:56,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:49:56,665 INFO L87 Difference]: Start difference. First operand has 89 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 21:49:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:49:56,693 INFO L93 Difference]: Finished difference Result 172 states and 305 transitions. [2025-02-05 21:49:56,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:49:56,695 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, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-02-05 21:49:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:49:56,700 INFO L225 Difference]: With dead ends: 172 [2025-02-05 21:49:56,701 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 21:49:56,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:49:56,708 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:49:56,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:49:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 21:49:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-05 21:49:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 21:49:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2025-02-05 21:49:56,751 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 203 [2025-02-05 21:49:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:49:56,752 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2025-02-05 21:49:56,752 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, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 21:49:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2025-02-05 21:49:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:49:56,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:49:56,771 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:49:56,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:49:56,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:49:56,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:49:56,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:49:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash -886621260, now seen corresponding path program 1 times [2025-02-05 21:49:56,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:49:56,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342279490] [2025-02-05 21:49:56,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:49:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:49:57,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:49:57,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:49:57,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:49:57,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:50:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 21:50:01,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:50:01,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342279490] [2025-02-05 21:50:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342279490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:50:01,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:50:01,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 21:50:01,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736247518] [2025-02-05 21:50:01,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:50:01,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:50:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:50:01,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:50:01,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:50:01,609 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:50:02,306 INFO L93 Difference]: Finished difference Result 290 states and 429 transitions. [2025-02-05 21:50:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:50:02,307 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-02-05 21:50:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:50:02,309 INFO L225 Difference]: With dead ends: 290 [2025-02-05 21:50:02,309 INFO L226 Difference]: Without dead ends: 207 [2025-02-05 21:50:02,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:50:02,310 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 198 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:50:02,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 815 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:50:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-05 21:50:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 131. [2025-02-05 21:50:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 92 states have (on average 1.391304347826087) internal successors, (128), 93 states have internal predecessors, (128), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 21:50:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 200 transitions. [2025-02-05 21:50:02,326 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 200 transitions. Word has length 203 [2025-02-05 21:50:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:50:02,326 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 200 transitions. [2025-02-05 21:50:02,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 200 transitions. [2025-02-05 21:50:02,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:50:02,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:50:02,329 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:50:02,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:50:02,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:50:02,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:50:02,330 INFO L85 PathProgramCache]: Analyzing trace with hash -885697739, now seen corresponding path program 1 times [2025-02-05 21:50:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:50:02,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073824650] [2025-02-05 21:50:02,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:50:02,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:50:02,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:50:02,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:50:02,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:50:02,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:50:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 21:50:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:50:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073824650] [2025-02-05 21:50:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073824650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:50:05,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:50:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:50:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278813556] [2025-02-05 21:50:05,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:50:05,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:50:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:50:05,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:50:05,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:50:05,969 INFO L87 Difference]: Start difference. First operand 131 states and 200 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:50:06,875 INFO L93 Difference]: Finished difference Result 207 states and 290 transitions. [2025-02-05 21:50:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 21:50:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-02-05 21:50:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:50:06,877 INFO L225 Difference]: With dead ends: 207 [2025-02-05 21:50:06,877 INFO L226 Difference]: Without dead ends: 205 [2025-02-05 21:50:06,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:50:06,878 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 202 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:50:06,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 751 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:50:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-05 21:50:06,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 131. [2025-02-05 21:50:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 92 states have (on average 1.391304347826087) internal successors, (128), 93 states have internal predecessors, (128), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 21:50:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 200 transitions. [2025-02-05 21:50:06,894 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 200 transitions. Word has length 203 [2025-02-05 21:50:06,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:50:06,895 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 200 transitions. [2025-02-05 21:50:06,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 200 transitions. [2025-02-05 21:50:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:50:06,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:50:06,897 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:50:06,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:50:06,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:50:06,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:50:06,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1600891573, now seen corresponding path program 1 times [2025-02-05 21:50:06,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:50:06,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916355460] [2025-02-05 21:50:06,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:50:06,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:50:06,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:50:06,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:50:06,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:50:06,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:50:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 21:50:09,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:50:09,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916355460] [2025-02-05 21:50:09,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916355460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:50:09,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:50:09,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 21:50:09,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590878668] [2025-02-05 21:50:09,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:50:09,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:50:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:50:09,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:50:09,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:50:09,849 INFO L87 Difference]: Start difference. First operand 131 states and 200 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:50:10,535 INFO L93 Difference]: Finished difference Result 214 states and 298 transitions. [2025-02-05 21:50:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:50:10,536 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-02-05 21:50:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:50:10,538 INFO L225 Difference]: With dead ends: 214 [2025-02-05 21:50:10,539 INFO L226 Difference]: Without dead ends: 212 [2025-02-05 21:50:10,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:50:10,540 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 182 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:50:10,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 846 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:50:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-05 21:50:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 135. [2025-02-05 21:50:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 97 states have internal predecessors, (134), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 21:50:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 206 transitions. [2025-02-05 21:50:10,555 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 206 transitions. Word has length 203 [2025-02-05 21:50:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:50:10,556 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 206 transitions. [2025-02-05 21:50:10,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 206 transitions. [2025-02-05 21:50:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:50:10,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:50:10,557 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:50:10,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:50:10,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:50:10,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:50:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1601815094, now seen corresponding path program 1 times [2025-02-05 21:50:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:50:10,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245190845] [2025-02-05 21:50:10,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:50:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:50:10,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:50:10,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:50:10,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:50:10,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:50:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 21:50:14,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:50:14,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245190845] [2025-02-05 21:50:14,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245190845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:50:14,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:50:14,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:50:14,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209754127] [2025-02-05 21:50:14,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:50:14,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:50:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:50:14,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:50:14,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:50:14,431 INFO L87 Difference]: Start difference. First operand 135 states and 206 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:50:15,438 INFO L93 Difference]: Finished difference Result 212 states and 296 transitions. [2025-02-05 21:50:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 21:50:15,439 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-02-05 21:50:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:50:15,441 INFO L225 Difference]: With dead ends: 212 [2025-02-05 21:50:15,441 INFO L226 Difference]: Without dead ends: 210 [2025-02-05 21:50:15,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:50:15,442 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 185 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:50:15,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 718 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:50:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-05 21:50:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 131. [2025-02-05 21:50:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 92 states have (on average 1.391304347826087) internal successors, (128), 93 states have internal predecessors, (128), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 21:50:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 200 transitions. [2025-02-05 21:50:15,466 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 200 transitions. Word has length 203 [2025-02-05 21:50:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:50:15,467 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 200 transitions. [2025-02-05 21:50:15,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 200 transitions. [2025-02-05 21:50:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:50:15,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:50:15,469 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:50:15,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:50:15,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:50:15,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:50:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash -757538541, now seen corresponding path program 1 times [2025-02-05 21:50:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:50:15,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933578877] [2025-02-05 21:50:15,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:50:15,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:50:15,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:50:15,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:50:15,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:50:15,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:50:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 21:50:15,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:50:15,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933578877] [2025-02-05 21:50:15,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933578877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:50:15,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:50:15,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:50:15,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592880391] [2025-02-05 21:50:15,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:50:15,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:50:15,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:50:15,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:50:15,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:50:15,513 INFO L87 Difference]: Start difference. First operand 131 states and 200 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:50:15,546 INFO L93 Difference]: Finished difference Result 368 states and 566 transitions. [2025-02-05 21:50:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:50:15,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-02-05 21:50:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:50:15,549 INFO L225 Difference]: With dead ends: 368 [2025-02-05 21:50:15,549 INFO L226 Difference]: Without dead ends: 240 [2025-02-05 21:50:15,549 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 21:50:15,550 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 121 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:50:15,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 366 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:50:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-05 21:50:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2025-02-05 21:50:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 161 states have (on average 1.329192546583851) internal successors, (214), 163 states have internal predecessors, (214), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-05 21:50:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 358 transitions. [2025-02-05 21:50:15,569 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 358 transitions. Word has length 203 [2025-02-05 21:50:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:50:15,570 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 358 transitions. [2025-02-05 21:50:15,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 358 transitions. [2025-02-05 21:50:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:50:15,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:50:15,571 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:50:15,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:50:15,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:50:15,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:50:15,572 INFO L85 PathProgramCache]: Analyzing trace with hash 985271794, now seen corresponding path program 1 times [2025-02-05 21:50:15,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:50:15,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019086205] [2025-02-05 21:50:15,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:50:15,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:50:15,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:50:15,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:50:15,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:50:15,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:50:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 21:50:15,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:50:15,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019086205] [2025-02-05 21:50:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019086205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:50:15,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:50:15,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:50:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749788237] [2025-02-05 21:50:15,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:50:15,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:50:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:50:15,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:50:15,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:50:15,649 INFO L87 Difference]: Start difference. First operand 238 states and 358 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:50:15,834 INFO L93 Difference]: Finished difference Result 704 states and 1049 transitions. [2025-02-05 21:50:15,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:50:15,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-02-05 21:50:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:50:15,840 INFO L225 Difference]: With dead ends: 704 [2025-02-05 21:50:15,840 INFO L226 Difference]: Without dead ends: 469 [2025-02-05 21:50:15,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:50:15,844 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 91 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:50:15,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 398 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:50:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-05 21:50:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 424. [2025-02-05 21:50:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 275 states have (on average 1.3054545454545454) internal successors, (359), 278 states have internal predecessors, (359), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 137 states have call predecessors, (140), 140 states have call successors, (140) [2025-02-05 21:50:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 639 transitions. [2025-02-05 21:50:15,892 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 639 transitions. Word has length 203 [2025-02-05 21:50:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:50:15,892 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 639 transitions. [2025-02-05 21:50:15,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 639 transitions. [2025-02-05 21:50:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:50:15,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:50:15,896 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:50:15,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:50:15,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:50:15,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:50:15,896 INFO L85 PathProgramCache]: Analyzing trace with hash -822182669, now seen corresponding path program 1 times [2025-02-05 21:50:15,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:50:15,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075963728] [2025-02-05 21:50:15,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:50:15,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:50:15,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:50:15,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:50:15,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:50:15,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:50:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 21:50:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:50:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075963728] [2025-02-05 21:50:33,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075963728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:50:33,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:50:33,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 21:50:33,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532664372] [2025-02-05 21:50:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:50:33,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:50:33,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:50:33,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:50:33,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:50:33,024 INFO L87 Difference]: Start difference. First operand 424 states and 639 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:50:35,472 INFO L93 Difference]: Finished difference Result 554 states and 788 transitions. [2025-02-05 21:50:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 21:50:35,475 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-02-05 21:50:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:50:35,478 INFO L225 Difference]: With dead ends: 554 [2025-02-05 21:50:35,481 INFO L226 Difference]: Without dead ends: 552 [2025-02-05 21:50:35,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-02-05 21:50:35,482 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 382 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:50:35,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 729 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:50:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-05 21:50:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 474. [2025-02-05 21:50:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 314 states have (on average 1.2898089171974523) internal successors, (405), 319 states have internal predecessors, (405), 148 states have call successors, (148), 11 states have call predecessors, (148), 11 states have return successors, (148), 143 states have call predecessors, (148), 148 states have call successors, (148) [2025-02-05 21:50:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 701 transitions. [2025-02-05 21:50:35,539 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 701 transitions. Word has length 203 [2025-02-05 21:50:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:50:35,540 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 701 transitions. [2025-02-05 21:50:35,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 701 transitions. [2025-02-05 21:50:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:50:35,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:50:35,543 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:50:35,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:50:35,543 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:50:35,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:50:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash -821259148, now seen corresponding path program 1 times [2025-02-05 21:50:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:50:35,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692862288] [2025-02-05 21:50:35,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:50:35,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:50:35,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:50:35,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:50:35,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:50:35,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:50:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 21:50:38,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:50:38,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692862288] [2025-02-05 21:50:38,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692862288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:50:38,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:50:38,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 21:50:38,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744145152] [2025-02-05 21:50:38,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:50:38,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:50:38,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:50:38,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:50:38,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:50:38,645 INFO L87 Difference]: Start difference. First operand 474 states and 701 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:50:39,901 INFO L93 Difference]: Finished difference Result 568 states and 804 transitions. [2025-02-05 21:50:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:50:39,901 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-02-05 21:50:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:50:39,904 INFO L225 Difference]: With dead ends: 568 [2025-02-05 21:50:39,905 INFO L226 Difference]: Without dead ends: 566 [2025-02-05 21:50:39,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:50:39,907 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 273 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:50:39,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 764 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:50:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-05 21:50:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 480. [2025-02-05 21:50:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 320 states have (on average 1.2875) internal successors, (412), 325 states have internal predecessors, (412), 148 states have call successors, (148), 11 states have call predecessors, (148), 11 states have return successors, (148), 143 states have call predecessors, (148), 148 states have call successors, (148) [2025-02-05 21:50:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 708 transitions. [2025-02-05 21:50:39,998 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 708 transitions. Word has length 203 [2025-02-05 21:50:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:50:39,999 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 708 transitions. [2025-02-05 21:50:39,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-02-05 21:50:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 708 transitions. [2025-02-05 21:50:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:50:40,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:50:40,001 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:50:40,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:50:40,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:50:40,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:50:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1180024267, now seen corresponding path program 1 times [2025-02-05 21:50:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:50:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916629987] [2025-02-05 21:50:40,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:50:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:50:40,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:50:40,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:50:40,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:50:40,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:50:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-02-05 21:50:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:50:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916629987] [2025-02-05 21:50:40,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916629987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:50:40,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:50:40,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:50:40,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698566119] [2025-02-05 21:50:40,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:50:40,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:50:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:50:40,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:50:40,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:50:40,272 INFO L87 Difference]: Start difference. First operand 480 states and 708 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 21:50:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:50:40,545 INFO L93 Difference]: Finished difference Result 892 states and 1301 transitions. [2025-02-05 21:50:40,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:50:40,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-02-05 21:50:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:50:40,553 INFO L225 Difference]: With dead ends: 892 [2025-02-05 21:50:40,553 INFO L226 Difference]: Without dead ends: 487 [2025-02-05 21:50:40,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:50:40,555 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 145 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:50:40,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 254 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:50:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-02-05 21:50:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 478. [2025-02-05 21:50:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 312 states have (on average 1.2532051282051282) internal successors, (391), 317 states have internal predecessors, (391), 152 states have call successors, (152), 13 states have call predecessors, (152), 13 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-05 21:50:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 695 transitions. [2025-02-05 21:50:40,600 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 695 transitions. Word has length 203 [2025-02-05 21:50:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:50:40,600 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 695 transitions. [2025-02-05 21:50:40,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 21:50:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 695 transitions. [2025-02-05 21:50:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 21:50:40,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:50:40,602 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:50:40,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:50:40,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:50:40,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:50:40,603 INFO L85 PathProgramCache]: Analyzing trace with hash -541783539, now seen corresponding path program 1 times [2025-02-05 21:50:40,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:50:40,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331924003] [2025-02-05 21:50:40,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:50:40,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:50:40,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 21:50:40,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 21:50:40,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:50:40,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:50:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347564221] [2025-02-05 21:50:40,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:50:40,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:50:40,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:50:40,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:50:40,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:50:40,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 21:50:40,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 21:50:40,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:50:40,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:50:40,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 21:50:40,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:50:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 864 proven. 306 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2025-02-05 21:50:42,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:50:57,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:50:57,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331924003] [2025-02-05 21:50:57,482 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:50:57,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347564221] [2025-02-05 21:50:57,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347564221] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:50:57,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:50:57,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2025-02-05 21:50:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741667940] [2025-02-05 21:50:57,482 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 21:50:57,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 21:50:57,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:50:57,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 21:50:57,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=349, Unknown=3, NotChecked=0, Total=462 [2025-02-05 21:50:57,484 INFO L87 Difference]: Start difference. First operand 478 states and 695 transitions. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 6 states have call successors, (32), 6 states have call predecessors, (32), 9 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2025-02-05 21:51:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:51:02,031 INFO L93 Difference]: Finished difference Result 1188 states and 1597 transitions. [2025-02-05 21:51:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 21:51:02,031 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 6 states have call successors, (32), 6 states have call predecessors, (32), 9 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 204 [2025-02-05 21:51:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:51:02,035 INFO L225 Difference]: With dead ends: 1188 [2025-02-05 21:51:02,035 INFO L226 Difference]: Without dead ends: 783 [2025-02-05 21:51:02,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=287, Invalid=970, Unknown=3, NotChecked=0, Total=1260 [2025-02-05 21:51:02,037 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 111 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:51:02,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 536 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 21:51:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-02-05 21:51:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 669. [2025-02-05 21:51:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 446 states have (on average 1.1816143497757847) internal successors, (527), 457 states have internal predecessors, (527), 180 states have call successors, (180), 42 states have call predecessors, (180), 42 states have return successors, (180), 169 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-05 21:51:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 887 transitions. [2025-02-05 21:51:02,098 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 887 transitions. Word has length 204 [2025-02-05 21:51:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:51:02,099 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 887 transitions. [2025-02-05 21:51:02,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 6 states have call successors, (32), 6 states have call predecessors, (32), 9 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2025-02-05 21:51:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 887 transitions. [2025-02-05 21:51:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 21:51:02,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:51:02,100 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:51:02,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 21:51:02,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:51:02,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:51:02,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:51:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash -540860018, now seen corresponding path program 1 times [2025-02-05 21:51:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:51:02,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315969223] [2025-02-05 21:51:02,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:51:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:51:02,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 21:51:02,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 21:51:02,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:51:02,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:51:02,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386913077] [2025-02-05 21:51:02,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:51:02,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:51:02,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:51:02,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:51:02,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 21:51:02,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 21:51:02,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 21:51:02,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:51:02,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:51:02,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 21:51:02,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 21:51:02,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 21:51:02,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:51:02,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:51:02,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 21:51:02,614 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 21:51:02,615 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 21:51:02,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 21:51:02,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:51:02,820 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:51:03,008 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 21:51:03,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 09:51:03 BoogieIcfgContainer [2025-02-05 21:51:03,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 21:51:03,011 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 21:51:03,011 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 21:51:03,011 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 21:51:03,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:49:55" (3/4) ... [2025-02-05 21:51:03,017 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 21:51:03,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 21:51:03,022 INFO L158 Benchmark]: Toolchain (without parser) took 67858.02ms. Allocated memory was 201.3MB in the beginning and 167.8MB in the end (delta: -33.6MB). Free memory was 154.5MB in the beginning and 80.9MB in the end (delta: 73.6MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2025-02-05 21:51:03,022 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:51:03,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.28ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 140.0MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 21:51:03,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.71ms. Allocated memory is still 201.3MB. Free memory was 140.0MB in the beginning and 136.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:51:03,023 INFO L158 Benchmark]: Boogie Preprocessor took 36.24ms. Allocated memory is still 201.3MB. Free memory was 136.9MB in the beginning and 132.8MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 21:51:03,023 INFO L158 Benchmark]: IcfgBuilder took 364.43ms. Allocated memory is still 201.3MB. Free memory was 132.8MB in the beginning and 108.3MB in the end (delta: 24.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 21:51:03,023 INFO L158 Benchmark]: TraceAbstraction took 67089.20ms. Allocated memory was 201.3MB in the beginning and 167.8MB in the end (delta: -33.6MB). Free memory was 108.0MB in the beginning and 81.3MB in the end (delta: 26.6MB). Peak memory consumption was 261.5MB. Max. memory is 16.1GB. [2025-02-05 21:51:03,023 INFO L158 Benchmark]: Witness Printer took 10.23ms. Allocated memory is still 167.8MB. Free memory was 81.3MB in the beginning and 80.9MB in the end (delta: 452.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 21:51:03,024 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.17ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.28ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 140.0MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.71ms. Allocated memory is still 201.3MB. Free memory was 140.0MB in the beginning and 136.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.24ms. Allocated memory is still 201.3MB. Free memory was 136.9MB in the beginning and 132.8MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 364.43ms. Allocated memory is still 201.3MB. Free memory was 132.8MB in the beginning and 108.3MB in the end (delta: 24.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 67089.20ms. Allocated memory was 201.3MB in the beginning and 167.8MB in the end (delta: -33.6MB). Free memory was 108.0MB in the beginning and 81.3MB in the end (delta: 26.6MB). Peak memory consumption was 261.5MB. Max. memory is 16.1GB. * Witness Printer took 10.23ms. Allocated memory is still 167.8MB. Free memory was 81.3MB in the beginning and 80.9MB in the end (delta: 452.0kB). Peak memory consumption was 8.4MB. 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 someBinaryDOUBLEComparisonOperation at line 174. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] signed long int var_1_22 = -8; [L40] unsigned char var_1_23 = 1; [L41] signed long int var_1_24 = 5; [L42] signed long int var_1_25 = -128; [L43] unsigned long int var_1_26 = 10; [L44] unsigned long int var_1_27 = 5; [L45] signed long int var_1_28 = -10000; [L46] signed long int var_1_29 = -1263929197; [L47] signed long int var_1_30 = 500; [L48] signed short int var_1_31 = 1; [L49] signed short int var_1_32 = -500; [L50] signed long int var_1_33 = 32; [L51] signed long int var_1_34 = -1000000; [L52] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L178] isInitial = 1 [L179] FCALL initially() [L180] COND TRUE 1 [L181] CALL updateLastVariables() [L171] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L181] RET updateLastVariables() [L182] CALL updateVariables() [L121] var_1_3 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L122] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L123] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L123] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L124] var_1_4 = __VERIFIER_nondet_char() [L125] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L125] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L126] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L126] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L127] var_1_6 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L128] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L129] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L129] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L130] var_1_7 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L131] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L132] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L132] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L133] var_1_10 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L134] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L135] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L135] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L136] var_1_11 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L137] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L138] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L138] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L139] var_1_14 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L140] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L141] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L141] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L142] var_1_20 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L143] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L144] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L144] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L145] var_1_21 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L146] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L147] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L147] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L148] var_1_23 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L149] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L150] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L150] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L151] var_1_24 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_24 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L152] RET assume_abort_if_not(var_1_24 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L153] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L153] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L154] var_1_25 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_25 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L155] RET assume_abort_if_not(var_1_25 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L156] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L156] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L157] var_1_27 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L158] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L159] CALL assume_abort_if_not(var_1_27 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L159] RET assume_abort_if_not(var_1_27 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L160] var_1_29 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_29 >= -2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L161] RET assume_abort_if_not(var_1_29 >= -2147483646) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L162] CALL assume_abort_if_not(var_1_29 <= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L162] RET assume_abort_if_not(var_1_29 <= -1073741823) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L163] var_1_30 = __VERIFIER_nondet_long() [L164] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L164] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L165] CALL assume_abort_if_not(var_1_30 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L165] RET assume_abort_if_not(var_1_30 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L166] var_1_32 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_32 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L167] RET assume_abort_if_not(var_1_32 >= -32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L168] CALL assume_abort_if_not(var_1_32 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L168] RET assume_abort_if_not(var_1_32 <= 32766) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L182] RET updateVariables() [L183] CALL step() [L56] COND FALSE !(var_1_24 > var_1_25) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=10, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L61] var_1_26 = var_1_27 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-10000, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L62] COND TRUE ((((-256) < 0 ) ? -(-256) : (-256))) < var_1_24 [L63] var_1_28 = (5 - (((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29))) - var_1_30)) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L67] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L68] COND TRUE var_1_31 < var_1_26 [L69] var_1_33 = ((((var_1_30) < ((var_1_31 + 1))) ? (var_1_30) : ((var_1_31 + 1)))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L73] COND TRUE var_1_26 < var_1_28 [L74] var_1_34 = ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L76] signed char stepLocal_1 = var_1_6; [L77] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=256] [L78] COND FALSE !(-25 == stepLocal_1) [L83] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=49274] [L85] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=123, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=49274] [L86] COND TRUE var_1_8 >= stepLocal_2 [L87] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=49274] [L89] COND TRUE \read(var_1_12) [L90] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=49274] [L92] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=123, var_1_8=49274] [L93] COND TRUE \read(var_1_12) [L94] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=123, var_1_8=49274] [L97] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=123, var_1_8=49274] [L98] COND TRUE var_1_1 < stepLocal_4 [L99] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-122, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=123, var_1_8=49274] [L103] COND TRUE \read(var_1_12) [L104] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-122, var_1_19=-16259, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=123, var_1_8=49274] [L106] COND TRUE -64 > (var_1_6 + var_1_19) [L107] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-122, var_1_19=-16259, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=123, var_1_8=49274] [L115] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=49275, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-122, var_1_19=-16259, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=123, var_1_8=49274] [L116] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-122, var_1_19=-16259, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=123, var_1_8=49274] [L183] RET step() [L184] CALL, EXPR property() [L174-L175] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-122, var_1_19=-16259, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=123, var_1_8=49274] [L184] RET, EXPR property() [L184] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-122, var_1_19=-16259, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=123, var_1_8=49274] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49274, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-122, var_1_19=-16259, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=257, var_1_25=257, var_1_26=2147483655, var_1_27=2147483655, var_1_28=-2147483640, var_1_29=-2147483646, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=123, var_1_8=49274] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.9s, OverallIterations: 12, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1895 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1890 mSDsluCounter, 6311 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4730 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3953 IncrementalHoareTripleChecker+Invalid, 4171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 1581 mSDtfsCounter, 3953 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=669occurred in iteration=11, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 640 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 52.1s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2425 ConstructedInterpolants, 1 QuantifiedInterpolants, 18160 SizeOfPredicates, 8 NumberOfNonLiveVariables, 933 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 23440/23808 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 21:51:03,239 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-02-05 21:51:03,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.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 f51329798d39553bfe6698070ebd1150c84493b84ecd2c17e90b69fb6b7c2e13 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:51:05,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:51:05,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 21:51:05,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:51:05,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:51:05,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:51:05,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:51:05,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:51:05,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:51:05,150 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:51:05,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:51:05,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:51:05,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:51:05,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:51:05,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:51:05,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:51:05,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:51:05,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:51:05,152 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 -> f51329798d39553bfe6698070ebd1150c84493b84ecd2c17e90b69fb6b7c2e13 [2025-02-05 21:51:05,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:51:05,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:51:05,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:51:05,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:51:05,413 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:51:05,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2025-02-05 21:51:06,565 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ed8e16d8/c76654bbd72b49f691710375e4dcdbb8/FLAGdc12e4feb [2025-02-05 21:51:06,775 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:51:06,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2025-02-05 21:51:06,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ed8e16d8/c76654bbd72b49f691710375e4dcdbb8/FLAGdc12e4feb [2025-02-05 21:51:07,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ed8e16d8/c76654bbd72b49f691710375e4dcdbb8 [2025-02-05 21:51:07,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:51:07,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:51:07,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:51:07,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:51:07,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:51:07,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a1994a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07, skipping insertion in model container [2025-02-05 21:51:07,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:51:07,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i[915,928] [2025-02-05 21:51:07,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:51:07,328 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:51:07,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i[915,928] [2025-02-05 21:51:07,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:51:07,367 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:51:07,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07 WrapperNode [2025-02-05 21:51:07,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:51:07,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:51:07,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:51:07,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:51:07,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,397 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-02-05 21:51:07,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:51:07,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:51:07,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:51:07,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:51:07,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:51:07,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:51:07,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:51:07,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:51:07,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:51:07,441 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (1/1) ... [2025-02-05 21:51:07,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:51:07,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:51:07,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:51:07,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:51:07,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:51:07,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 21:51:07,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:51:07,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:51:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:51:07,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:51:07,569 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:51:07,571 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:51:07,838 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 21:51:07,838 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:51:07,849 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:51:07,849 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:51:07,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:51:07 BoogieIcfgContainer [2025-02-05 21:51:07,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:51:07,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:51:07,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:51:07,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:51:07,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:51:07" (1/3) ... [2025-02-05 21:51:07,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5a3876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:51:07, skipping insertion in model container [2025-02-05 21:51:07,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:51:07" (2/3) ... [2025-02-05 21:51:07,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5a3876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:51:07, skipping insertion in model container [2025-02-05 21:51:07,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:51:07" (3/3) ... [2025-02-05 21:51:07,860 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2025-02-05 21:51:07,872 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:51:07,873 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-66.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:51:07,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:51:07,933 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;@4f97f448, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:51:07,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:51:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 21:51:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:51:07,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:51:07,945 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:51:07,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:51:07,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:51:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash 373431220, now seen corresponding path program 1 times [2025-02-05 21:51:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:51:07,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900561530] [2025-02-05 21:51:07,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:51:07,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:51:07,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:51:07,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:51:07,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 21:51:08,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:51:08,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:51:08,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:51:08,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:51:08,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:51:08,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:51:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 21:51:08,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:51:08,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:51:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900561530] [2025-02-05 21:51:08,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900561530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:51:08,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:51:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 21:51:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041498064] [2025-02-05 21:51:08,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:51:08,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:51:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:51:08,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:51:08,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:51:08,236 INFO L87 Difference]: Start difference. First operand has 89 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 21:51:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:51:08,257 INFO L93 Difference]: Finished difference Result 172 states and 305 transitions. [2025-02-05 21:51:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:51:08,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-02-05 21:51:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:51:08,262 INFO L225 Difference]: With dead ends: 172 [2025-02-05 21:51:08,262 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 21:51:08,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:51:08,266 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:51:08,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:51:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 21:51:08,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-05 21:51:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 21:51:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2025-02-05 21:51:08,294 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 203 [2025-02-05 21:51:08,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:51:08,294 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2025-02-05 21:51:08,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 21:51:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2025-02-05 21:51:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:51:08,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:51:08,302 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:51:08,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 21:51:08,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:51:08,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:51:08,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:51:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash -886621260, now seen corresponding path program 1 times [2025-02-05 21:51:08,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:51:08,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564018919] [2025-02-05 21:51:08,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:51:08,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:51:08,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:51:08,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:51:08,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 21:51:08,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:51:08,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:51:08,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:51:08,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:51:08,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 21:51:08,648 INFO L279 TraceCheckSpWp]: Computing forward predicates...