./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 12bb580d008789dc82bd22e84ab6c6fa66b09798075ab5a16232b78d93de6996 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:50:08,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:50:08,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:50:08,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:50:08,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:50:08,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:50:08,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:50:08,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:50:08,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:50:08,505 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:50:08,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:50:08,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:50:08,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:50:08,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:50:08,506 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:50:08,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:50:08,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:50:08,508 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:50:08,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:50:08,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:50:08,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:50:08,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:50:08,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:50:08,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:50:08,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:50:08,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:50:08,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:50:08,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:50:08,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:50:08,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:50:08,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:50:08,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:50:08,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:50:08,509 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/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 -> 12bb580d008789dc82bd22e84ab6c6fa66b09798075ab5a16232b78d93de6996 [2025-03-08 10:50:08,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:50:08,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:50:08,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:50:08,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:50:08,761 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:50:08,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-08 10:50:09,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c17396c/47ea7ab6b23f4435ae2bdc05712fbec3/FLAGed70d7769 [2025-03-08 10:50:10,149 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:50:10,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-08 10:50:10,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c17396c/47ea7ab6b23f4435ae2bdc05712fbec3/FLAGed70d7769 [2025-03-08 10:50:10,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c17396c/47ea7ab6b23f4435ae2bdc05712fbec3 [2025-03-08 10:50:10,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:50:10,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:50:10,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:50:10,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:50:10,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:50:10,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c39ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10, skipping insertion in model container [2025-03-08 10:50:10,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:50:10,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i[915,928] [2025-03-08 10:50:10,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:50:10,704 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:50:10,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i[915,928] [2025-03-08 10:50:10,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:50:10,763 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:50:10,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10 WrapperNode [2025-03-08 10:50:10,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:50:10,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:50:10,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:50:10,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:50:10,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,814 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-03-08 10:50:10,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:50:10,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:50:10,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:50:10,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:50:10,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,840 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-03-08 10:50:10,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:50:10,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:50:10,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:50:10,858 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:50:10,858 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (1/1) ... [2025-03-08 10:50:10,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:50:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:50:10,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:50:10,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:50:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:50:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:50:10,913 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:50:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:50:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:50:10,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:50:10,984 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:50:10,985 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:50:11,276 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:50:11,276 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:50:11,291 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:50:11,291 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:50:11,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:50:11 BoogieIcfgContainer [2025-03-08 10:50:11,291 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:50:11,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:50:11,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:50:11,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:50:11,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:50:10" (1/3) ... [2025-03-08 10:50:11,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5769a41b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:50:11, skipping insertion in model container [2025-03-08 10:50:11,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:50:10" (2/3) ... [2025-03-08 10:50:11,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5769a41b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:50:11, skipping insertion in model container [2025-03-08 10:50:11,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:50:11" (3/3) ... [2025-03-08 10:50:11,300 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-08 10:50:11,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:50:11,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-66.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:50:11,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:50:11,381 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;@5c5db9c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:50:11,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:50:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:50:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:50:11,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:11,401 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:11,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:11,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:11,406 INFO L85 PathProgramCache]: Analyzing trace with hash -700602216, now seen corresponding path program 1 times [2025-03-08 10:50:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:11,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538322245] [2025-03-08 10:50:11,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:11,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:11,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:11,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:11,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:11,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 10:50:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:11,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538322245] [2025-03-08 10:50:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538322245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:50:11,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410145515] [2025-03-08 10:50:11,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:11,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:50:11,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:50:11,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:50:11,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:50:11,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:11,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:11,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:11,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:11,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:50:11,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:50:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 10:50:11,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:50:11,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410145515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:11,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:50:11,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:50:11,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415322060] [2025-03-08 10:50:11,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:11,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:50:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:11,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:50:11,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:50:11,935 INFO L87 Difference]: Start difference. First operand has 86 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:50:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:11,957 INFO L93 Difference]: Finished difference Result 166 states and 296 transitions. [2025-03-08 10:50:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:50:11,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-08 10:50:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:11,964 INFO L225 Difference]: With dead ends: 166 [2025-03-08 10:50:11,964 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 10:50:11,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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-03-08 10:50:11,970 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:11,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:50:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 10:50:12,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 10:50:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:50:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2025-03-08 10:50:12,017 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 204 [2025-03-08 10:50:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:12,018 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2025-03-08 10:50:12,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:50:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2025-03-08 10:50:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:50:12,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:12,021 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:12,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:50:12,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:50:12,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:12,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:12,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1165162329, now seen corresponding path program 1 times [2025-03-08 10:50:12,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:12,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470197448] [2025-03-08 10:50:12,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:12,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:12,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:12,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:12,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:50:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470197448] [2025-03-08 10:50:38,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470197448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:38,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:38,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 10:50:38,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375116611] [2025-03-08 10:50:38,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:38,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 10:50:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:38,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 10:50:38,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:50:38,137 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:39,210 INFO L93 Difference]: Finished difference Result 248 states and 376 transitions. [2025-03-08 10:50:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:50:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:50:39,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:39,213 INFO L225 Difference]: With dead ends: 248 [2025-03-08 10:50:39,213 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 10:50:39,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 10:50:39,214 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 190 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:39,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 614 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:50:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 10:50:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 103. [2025-03-08 10:50:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:50:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2025-03-08 10:50:39,229 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 204 [2025-03-08 10:50:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:39,232 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2025-03-08 10:50:39,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2025-03-08 10:50:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:50:39,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:39,237 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:39,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:50:39,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:39,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1166085850, now seen corresponding path program 1 times [2025-03-08 10:50:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:39,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755418169] [2025-03-08 10:50:39,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:39,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:39,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:39,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:39,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:50:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755418169] [2025-03-08 10:50:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755418169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 10:50:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263464662] [2025-03-08 10:50:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:42,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 10:50:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:42,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 10:50:42,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:50:42,490 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:43,561 INFO L93 Difference]: Finished difference Result 207 states and 288 transitions. [2025-03-08 10:50:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 10:50:43,561 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:50:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:43,563 INFO L225 Difference]: With dead ends: 207 [2025-03-08 10:50:43,563 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 10:50:43,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 10:50:43,564 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 168 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:43,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 956 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:50:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 10:50:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 131. [2025-03-08 10:50:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 92 states have internal predecessors, (125), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 10:50:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2025-03-08 10:50:43,585 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 204 [2025-03-08 10:50:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:43,585 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2025-03-08 10:50:43,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2025-03-08 10:50:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:50:43,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:43,591 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:43,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:50:43,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:43,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash -642292134, now seen corresponding path program 1 times [2025-03-08 10:50:43,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:43,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602669697] [2025-03-08 10:50:43,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:43,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:43,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:43,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:43,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:43,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:50:46,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:46,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602669697] [2025-03-08 10:50:46,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602669697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:46,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:46,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 10:50:46,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19333411] [2025-03-08 10:50:46,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:46,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 10:50:46,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:46,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 10:50:46,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:50:46,484 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:47,151 INFO L93 Difference]: Finished difference Result 211 states and 293 transitions. [2025-03-08 10:50:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:50:47,151 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:50:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:47,153 INFO L225 Difference]: With dead ends: 211 [2025-03-08 10:50:47,153 INFO L226 Difference]: Without dead ends: 209 [2025-03-08 10:50:47,154 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-03-08 10:50:47,154 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 219 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:47,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 958 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:50:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-08 10:50:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 133. [2025-03-08 10:50:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 94 states have internal predecessors, (128), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 10:50:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2025-03-08 10:50:47,165 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 204 [2025-03-08 10:50:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:47,166 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2025-03-08 10:50:47,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2025-03-08 10:50:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:50:47,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:47,168 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:47,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:50:47,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:47,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash -641368613, now seen corresponding path program 1 times [2025-03-08 10:50:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:47,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991961990] [2025-03-08 10:50:47,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:47,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:47,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:47,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:47,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:47,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:50:50,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:50,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991961990] [2025-03-08 10:50:50,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991961990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:50,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:50,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 10:50:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678390812] [2025-03-08 10:50:50,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:50,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 10:50:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:50,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 10:50:50,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:50:50,813 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:51,934 INFO L93 Difference]: Finished difference Result 209 states and 291 transitions. [2025-03-08 10:50:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 10:50:51,934 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:50:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:51,936 INFO L225 Difference]: With dead ends: 209 [2025-03-08 10:50:51,936 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 10:50:51,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 10:50:51,937 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 186 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:51,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 843 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:50:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 10:50:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2025-03-08 10:50:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 94 states have internal predecessors, (128), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 10:50:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2025-03-08 10:50:51,947 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 204 [2025-03-08 10:50:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:51,948 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2025-03-08 10:50:51,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2025-03-08 10:50:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:50:51,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:51,949 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:51,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:50:51,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:51,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:51,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1294245048, now seen corresponding path program 1 times [2025-03-08 10:50:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478914728] [2025-03-08 10:50:51,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:51,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:51,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:51,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:51,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:50:52,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:52,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478914728] [2025-03-08 10:50:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478914728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:52,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:50:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676300462] [2025-03-08 10:50:52,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:52,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:50:52,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:52,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:50:52,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:50:52,002 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:52,040 INFO L93 Difference]: Finished difference Result 369 states and 565 transitions. [2025-03-08 10:50:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:50:52,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:50:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:52,044 INFO L225 Difference]: With dead ends: 369 [2025-03-08 10:50:52,044 INFO L226 Difference]: Without dead ends: 239 [2025-03-08 10:50:52,044 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-03-08 10:50:52,048 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 116 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 351 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-03-08 10:50:52,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 351 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:50:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-08 10:50:52,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2025-03-08 10:50:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 158 states have (on average 1.3101265822784811) internal successors, (207), 160 states have internal predecessors, (207), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 10:50:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 355 transitions. [2025-03-08 10:50:52,082 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 355 transitions. Word has length 204 [2025-03-08 10:50:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:52,083 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 355 transitions. [2025-03-08 10:50:52,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 355 transitions. [2025-03-08 10:50:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:50:52,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:52,085 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:52,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:50:52,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:52,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1257911913, now seen corresponding path program 1 times [2025-03-08 10:50:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:52,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035865623] [2025-03-08 10:50:52,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:52,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:52,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:52,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:52,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:50:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:52,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035865623] [2025-03-08 10:50:52,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035865623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:52,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:52,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:50:52,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067033305] [2025-03-08 10:50:52,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:52,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:50:52,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:52,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:50:52,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:50:52,168 INFO L87 Difference]: Start difference. First operand 237 states and 355 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:52,368 INFO L93 Difference]: Finished difference Result 696 states and 1033 transitions. [2025-03-08 10:50:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:50:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:50:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:52,373 INFO L225 Difference]: With dead ends: 696 [2025-03-08 10:50:52,374 INFO L226 Difference]: Without dead ends: 462 [2025-03-08 10:50:52,375 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-03-08 10:50:52,375 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 89 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:52,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 374 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:50:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-08 10:50:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 417. [2025-03-08 10:50:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 264 states have (on average 1.2803030303030303) internal successors, (338), 267 states have internal predecessors, (338), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 141 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-08 10:50:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 626 transitions. [2025-03-08 10:50:52,432 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 626 transitions. Word has length 204 [2025-03-08 10:50:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:52,432 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 626 transitions. [2025-03-08 10:50:52,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 626 transitions. [2025-03-08 10:50:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:50:52,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:52,434 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:52,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:50:52,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:52,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1229600920, now seen corresponding path program 1 times [2025-03-08 10:50:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:52,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163754265] [2025-03-08 10:50:52,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:52,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:52,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:52,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:52,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:52,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:50:53,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:53,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163754265] [2025-03-08 10:50:53,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163754265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:53,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:53,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 10:50:53,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305177098] [2025-03-08 10:50:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:53,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 10:50:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:53,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 10:50:53,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:50:53,796 INFO L87 Difference]: Start difference. First operand 417 states and 626 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:54,479 INFO L93 Difference]: Finished difference Result 563 states and 793 transitions. [2025-03-08 10:50:54,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 10:50:54,479 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:50:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:54,482 INFO L225 Difference]: With dead ends: 563 [2025-03-08 10:50:54,482 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 10:50:54,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:50:54,483 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 250 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:54,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 718 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:50:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 10:50:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 473. [2025-03-08 10:50:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 309 states have (on average 1.2653721682847896) internal successors, (391), 314 states have internal predecessors, (391), 152 states have call successors, (152), 11 states have call predecessors, (152), 11 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 10:50:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 695 transitions. [2025-03-08 10:50:54,525 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 695 transitions. Word has length 204 [2025-03-08 10:50:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:54,525 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 695 transitions. [2025-03-08 10:50:54,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 695 transitions. [2025-03-08 10:50:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:50:54,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:54,526 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:54,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:50:54,527 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:54,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:54,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1230524441, now seen corresponding path program 1 times [2025-03-08 10:50:54,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:54,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409863552] [2025-03-08 10:50:54,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:54,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:54,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:54,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:54,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:54,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:50:56,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:56,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409863552] [2025-03-08 10:50:56,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409863552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:56,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:56,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 10:50:56,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057421299] [2025-03-08 10:50:56,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:56,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 10:50:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:56,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 10:50:56,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:50:56,848 INFO L87 Difference]: Start difference. First operand 473 states and 695 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:57,757 INFO L93 Difference]: Finished difference Result 561 states and 791 transitions. [2025-03-08 10:50:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 10:50:57,757 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:50:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:57,760 INFO L225 Difference]: With dead ends: 561 [2025-03-08 10:50:57,760 INFO L226 Difference]: Without dead ends: 559 [2025-03-08 10:50:57,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:50:57,761 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 251 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:57,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 786 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:50:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-08 10:50:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2025-03-08 10:50:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 309 states have (on average 1.2653721682847896) internal successors, (391), 314 states have internal predecessors, (391), 152 states have call successors, (152), 11 states have call predecessors, (152), 11 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 10:50:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 695 transitions. [2025-03-08 10:50:57,797 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 695 transitions. Word has length 204 [2025-03-08 10:50:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:57,797 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 695 transitions. [2025-03-08 10:50:57,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:50:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 695 transitions. [2025-03-08 10:50:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:50:57,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:57,798 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:57,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:50:57,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:57,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:57,799 INFO L85 PathProgramCache]: Analyzing trace with hash 871759322, now seen corresponding path program 1 times [2025-03-08 10:50:57,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:57,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766439345] [2025-03-08 10:50:57,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:57,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:57,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:50:57,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:50:57,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:57,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:50:58,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:50:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766439345] [2025-03-08 10:50:58,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766439345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:50:58,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:50:58,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:50:58,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851110889] [2025-03-08 10:50:58,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:50:58,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:50:58,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:50:58,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:50:58,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:50:58,023 INFO L87 Difference]: Start difference. First operand 473 states and 695 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:50:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:50:58,209 INFO L93 Difference]: Finished difference Result 881 states and 1280 transitions. [2025-03-08 10:50:58,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:50:58,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-08 10:50:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:50:58,212 INFO L225 Difference]: With dead ends: 881 [2025-03-08 10:50:58,213 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 10:50:58,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-03-08 10:50:58,214 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 143 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:50:58,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 207 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:50:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 10:50:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 471. [2025-03-08 10:50:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 301 states have (on average 1.2292358803986712) internal successors, (370), 306 states have internal predecessors, (370), 156 states have call successors, (156), 13 states have call predecessors, (156), 13 states have return successors, (156), 151 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-08 10:50:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 682 transitions. [2025-03-08 10:50:58,250 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 682 transitions. Word has length 204 [2025-03-08 10:50:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:50:58,251 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 682 transitions. [2025-03-08 10:50:58,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:50:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 682 transitions. [2025-03-08 10:50:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 10:50:58,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:50:58,252 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:50:58,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:50:58,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:50:58,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:50:58,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1361001720, now seen corresponding path program 1 times [2025-03-08 10:50:58,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:50:58,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563278844] [2025-03-08 10:50:58,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:58,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:50:58,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:50:58,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:50:58,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:58,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:50:58,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825659600] [2025-03-08 10:50:58,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:50:58,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:50:58,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:50:58,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:50:58,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:50:58,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:50:58,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:50:58,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:50:58,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:50:58,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 10:50:58,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:51:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 900 proven. 321 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2025-03-08 10:51:00,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:51:02,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:51:02,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563278844] [2025-03-08 10:51:02,722 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 10:51:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825659600] [2025-03-08 10:51:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825659600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:51:02,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:51:02,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2025-03-08 10:51:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742928162] [2025-03-08 10:51:02,722 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 10:51:02,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 10:51:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:51:02,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 10:51:02,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-03-08 10:51:02,723 INFO L87 Difference]: Start difference. First operand 471 states and 682 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 20 states have internal predecessors, (67), 7 states have call successors, (33), 7 states have call predecessors, (33), 9 states have return successors, (33), 6 states have call predecessors, (33), 7 states have call successors, (33) [2025-03-08 10:51:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:03,739 INFO L93 Difference]: Finished difference Result 908 states and 1221 transitions. [2025-03-08 10:51:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 10:51:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 20 states have internal predecessors, (67), 7 states have call successors, (33), 7 states have call predecessors, (33), 9 states have return successors, (33), 6 states have call predecessors, (33), 7 states have call successors, (33) Word has length 205 [2025-03-08 10:51:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:03,744 INFO L225 Difference]: With dead ends: 908 [2025-03-08 10:51:03,744 INFO L226 Difference]: Without dead ends: 671 [2025-03-08 10:51:03,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=402, Invalid=1320, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 10:51:03,748 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 199 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:03,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 476 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:51:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-08 10:51:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 547. [2025-03-08 10:51:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 359 states have (on average 1.1838440111420614) internal successors, (425), 364 states have internal predecessors, (425), 154 states have call successors, (154), 33 states have call predecessors, (154), 33 states have return successors, (154), 149 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-08 10:51:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 733 transitions. [2025-03-08 10:51:03,803 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 733 transitions. Word has length 205 [2025-03-08 10:51:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:03,803 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 733 transitions. [2025-03-08 10:51:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 20 states have internal predecessors, (67), 7 states have call successors, (33), 7 states have call predecessors, (33), 9 states have return successors, (33), 6 states have call predecessors, (33), 7 states have call successors, (33) [2025-03-08 10:51:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 733 transitions. [2025-03-08 10:51:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 10:51:03,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:03,815 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:51:03,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:51:04,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 10:51:04,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:04,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1360078199, now seen corresponding path program 1 times [2025-03-08 10:51:04,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:04,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32280424] [2025-03-08 10:51:04,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:04,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:04,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:51:04,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:51:04,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:04,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:51:04,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1159659731] [2025-03-08 10:51:04,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:04,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:51:04,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:51:04,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:51:04,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:51:04,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:51:04,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:51:04,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:04,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:51:04,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:51:04,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:51:04,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:51:04,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:04,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:51:04,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:51:04,334 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:51:04,335 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:51:04,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 10:51:04,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:51:04,540 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:04,651 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:51:04,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:51:04 BoogieIcfgContainer [2025-03-08 10:51:04,656 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:51:04,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:51:04,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:51:04,657 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:51:04,657 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:50:11" (3/4) ... [2025-03-08 10:51:04,659 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:51:04,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:51:04,660 INFO L158 Benchmark]: Toolchain (without parser) took 54156.62ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 113.7MB in the beginning and 807.0MB in the end (delta: -693.2MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. [2025-03-08 10:51:04,660 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:51:04,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.94ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 98.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:51:04,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.80ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:51:04,661 INFO L158 Benchmark]: Boogie Preprocessor took 37.74ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 91.8MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:51:04,661 INFO L158 Benchmark]: IcfgBuilder took 434.01ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 67.8MB in the end (delta: 23.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:51:04,661 INFO L158 Benchmark]: TraceAbstraction took 53362.95ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 67.4MB in the beginning and 807.2MB in the end (delta: -739.8MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2025-03-08 10:51:04,662 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 947.9MB. Free memory was 807.2MB in the beginning and 807.0MB in the end (delta: 198.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:51:04,663 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.25ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.94ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 98.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.80ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.74ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 91.8MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 434.01ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 67.8MB in the end (delta: 23.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53362.95ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 67.4MB in the beginning and 807.2MB in the end (delta: -739.8MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 947.9MB. Free memory was 807.2MB in the beginning and 807.0MB in the end (delta: 198.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 157. 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 = 256; [L47] double var_1_30 = 2.75; [L48] double var_1_31 = 10.5; [L49] unsigned short int var_1_32 = 25; [L50] unsigned short int var_1_33 = 5; [L51] unsigned short int var_1_34 = 16; [L52] signed short int var_1_35 = 4; [L53] signed short int var_1_36 = 8; [L54] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, 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] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L166] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, 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] [L176] RET updateLastVariables() [L177] CALL updateVariables() [L114] var_1_3 = __VERIFIER_nondet_char() [L115] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L115] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L116] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L116] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L117] var_1_4 = __VERIFIER_nondet_char() [L118] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L118] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L119] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L119] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L120] var_1_6 = __VERIFIER_nondet_char() [L121] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=2, var_1_8=256] [L121] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=2, var_1_8=256] [L122] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=2, var_1_8=256] [L122] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=2, var_1_8=256] [L123] var_1_7 = __VERIFIER_nondet_char() [L124] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L124] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L125] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L125] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L126] var_1_10 = __VERIFIER_nondet_ushort() [L127] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L127] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L128] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L128] 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L129] var_1_11 = __VERIFIER_nondet_ushort() [L130] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L130] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L131] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L131] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L132] var_1_14 = __VERIFIER_nondet_uchar() [L133] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L133] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L134] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L134] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L135] var_1_20 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L136] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L137] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L137] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L138] var_1_21 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L139] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L140] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L140] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L141] var_1_23 = __VERIFIER_nondet_uchar() [L142] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L142] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L143] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L143] 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=32767, 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=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L144] var_1_24 = __VERIFIER_nondet_long() [L145] 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=32767, 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=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L145] 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=32767, 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=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L146] 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=32767, 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=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L146] 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=32767, 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=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L147] var_1_25 = __VERIFIER_nondet_long() [L148] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L148] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L149] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L149] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L150] var_1_27 = __VERIFIER_nondet_ulong() [L151] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L151] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L152] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L152] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L153] var_1_29 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_29 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L154] RET assume_abort_if_not(var_1_29 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L155] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L155] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L156] var_1_31 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L157] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L158] var_1_33 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L159] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L160] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L160] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L161] var_1_36 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_36 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L162] RET assume_abort_if_not(var_1_36 >= -32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L163] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L163] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L177] RET updateVariables() [L178] CALL step() [L58] COND FALSE !(var_1_24 > var_1_25) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L63] var_1_26 = var_1_27 [L64] var_1_28 = var_1_29 [L65] var_1_30 = var_1_31 [L66] var_1_32 = var_1_33 [L67] var_1_34 = var_1_33 [L68] var_1_35 = var_1_36 [L69] signed char stepLocal_1 = var_1_6; [L70] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=31, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L71] COND FALSE !(-25 == stepLocal_1) [L76] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=32767] [L78] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=127, var_1_10=49150, var_1_11=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=32767] [L79] COND TRUE var_1_8 >= stepLocal_2 [L80] 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=32767, 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=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=32767] [L82] COND TRUE \read(var_1_12) [L83] 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=32767, 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=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=32767] [L85] 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=32767, 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=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=32767] [L86] COND TRUE \read(var_1_12) [L87] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, 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=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L90] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=31, var_1_10=49150, var_1_11=32767, 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=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L91] COND TRUE var_1_1 < stepLocal_4 [L92] 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=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-96, var_1_19=25, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L96] COND TRUE \read(var_1_12) [L97] 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=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L99] COND TRUE -64 > (var_1_6 + var_1_19) [L100] 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=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L108] 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=32767, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L109] 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=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] 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=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 167 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.2s, OverallIterations: 12, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1819 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1811 mSDsluCounter, 6412 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4904 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4046 IncrementalHoareTripleChecker+Invalid, 4222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 1508 mSDtfsCounter, 4046 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 572 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=11, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 643 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 43.7s InterpolantComputationTime, 3064 NumberOfCodeBlocks, 3064 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2437 ConstructedInterpolants, 1 QuantifiedInterpolants, 18024 SizeOfPredicates, 9 NumberOfNonLiveVariables, 957 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 24959/25344 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-03-08 10:51:04,878 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-08 10:51:04,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 12bb580d008789dc82bd22e84ab6c6fa66b09798075ab5a16232b78d93de6996 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:51:06,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:51:06,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:51:06,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:51:06,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:51:06,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:51:06,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:51:06,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:51:06,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:51:06,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:51:06,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:51:06,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:51:06,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:51:06,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:51:06,628 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:51:06,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:51:06,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:51:06,628 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:51:06,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:51:06,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:51:06,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:51:06,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:51:06,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:51:06,629 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:51:06,629 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:51:06,629 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:51:06,629 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:51:06,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:51:06,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:51:06,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:51:06,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:51:06,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:51:06,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:51:06,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:51:06,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:51:06,631 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/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 -> 12bb580d008789dc82bd22e84ab6c6fa66b09798075ab5a16232b78d93de6996 [2025-03-08 10:51:06,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:51:06,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:51:06,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:51:06,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:51:06,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:51:06,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-08 10:51:08,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ddb84be/208de5211beb408fabe6411c952fe419/FLAG1a4887bea [2025-03-08 10:51:08,203 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:51:08,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-08 10:51:08,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ddb84be/208de5211beb408fabe6411c952fe419/FLAG1a4887bea [2025-03-08 10:51:08,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ddb84be/208de5211beb408fabe6411c952fe419 [2025-03-08 10:51:08,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:51:08,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:51:08,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:51:08,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:51:08,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:51:08,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494fa0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08, skipping insertion in model container [2025-03-08 10:51:08,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:51:08,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i[915,928] [2025-03-08 10:51:08,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:51:08,438 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:51:08,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i[915,928] [2025-03-08 10:51:08,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:51:08,493 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:51:08,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08 WrapperNode [2025-03-08 10:51:08,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:51:08,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:51:08,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:51:08,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:51:08,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,537 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-03-08 10:51:08,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:51:08,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:51:08,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:51:08,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:51:08,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,571 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-03-08 10:51:08,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:51:08,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:51:08,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:51:08,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:51:08,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (1/1) ... [2025-03-08 10:51:08,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:51:08,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:51:08,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:51:08,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:51:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:51:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:51:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:51:08,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:51:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:51:08,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:51:08,720 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:51:08,722 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:51:08,985 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:51:08,985 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:51:08,991 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:51:08,992 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:51:08,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:08 BoogieIcfgContainer [2025-03-08 10:51:08,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:51:08,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:51:08,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:51:08,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:51:08,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:51:08" (1/3) ... [2025-03-08 10:51:08,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8e8f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:08, skipping insertion in model container [2025-03-08 10:51:08,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:08" (2/3) ... [2025-03-08 10:51:08,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8e8f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:08, skipping insertion in model container [2025-03-08 10:51:08,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:08" (3/3) ... [2025-03-08 10:51:08,999 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-08 10:51:09,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:51:09,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-66.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:51:09,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:51:09,056 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;@ff0d882, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:51:09,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:51:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:51:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:51:09,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:09,072 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:51:09,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:09,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash -700602216, now seen corresponding path program 1 times [2025-03-08 10:51:09,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:51:09,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950045619] [2025-03-08 10:51:09,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:09,088 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-03-08 10:51:09,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:51:09,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-08 10:51:09,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 10:51:09,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:51:09,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:51:09,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:09,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:09,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:51:09,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:51:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-03-08 10:51:09,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:51:09,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:51:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950045619] [2025-03-08 10:51:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950045619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:09,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:51:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:51:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182255416] [2025-03-08 10:51:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:09,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:51:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:51:09,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:51:09,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:51:09,370 INFO L87 Difference]: Start difference. First operand has 86 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:51:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:09,389 INFO L93 Difference]: Finished difference Result 166 states and 296 transitions. [2025-03-08 10:51:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:51:09,390 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-08 10:51:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:09,395 INFO L225 Difference]: With dead ends: 166 [2025-03-08 10:51:09,395 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 10:51:09,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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-03-08 10:51:09,399 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:09,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:51:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 10:51:09,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 10:51:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:51:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2025-03-08 10:51:09,431 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 204 [2025-03-08 10:51:09,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:09,432 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2025-03-08 10:51:09,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:51:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2025-03-08 10:51:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:51:09,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:09,437 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:51:09,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 10:51:09,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-08 10:51:09,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:09,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:09,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1165162329, now seen corresponding path program 1 times [2025-03-08 10:51:09,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:51:09,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123908775] [2025-03-08 10:51:09,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:09,641 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-03-08 10:51:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:51:09,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-08 10:51:09,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 10:51:09,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:51:09,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:51:09,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:09,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:09,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 10:51:09,816 INFO L279 TraceCheckSpWp]: Computing forward predicates...