./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.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_fillercodestructure_filler-ps-ci_file-77.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 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:54:27,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:54:27,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:54:27,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:54:27,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:54:27,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:54:27,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:54:27,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:54:27,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:54:27,501 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:54:27,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:54:27,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:54:27,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:54:27,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:54:27,501 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:54:27,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:54:27,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:54:27,501 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:54:27,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:54:27,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:54:27,502 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:54:27,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:54:27,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:54:27,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:54:27,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:54:27,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:54:27,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:54:27,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:54:27,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:54:27,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:54:27,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:54:27,504 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 -> 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 [2025-03-08 12:54:27,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:54:27,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:54:27,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:54:27,732 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:54:27,732 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:54:27,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2025-03-08 12:54:28,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4601504/7b9d2f47f50a459fac429f66af06a705/FLAG3de9bbcf3 [2025-03-08 12:54:29,101 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:54:29,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2025-03-08 12:54:29,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4601504/7b9d2f47f50a459fac429f66af06a705/FLAG3de9bbcf3 [2025-03-08 12:54:29,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4601504/7b9d2f47f50a459fac429f66af06a705 [2025-03-08 12:54:29,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:54:29,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:54:29,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:54:29,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:54:29,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:54:29,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b81cc30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29, skipping insertion in model container [2025-03-08 12:54:29,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:54:29,523 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_fillercodestructure_filler-ps-ci_file-77.i[919,932] [2025-03-08 12:54:29,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:54:29,607 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:54:29,617 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_fillercodestructure_filler-ps-ci_file-77.i[919,932] [2025-03-08 12:54:29,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:54:29,659 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:54:29,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29 WrapperNode [2025-03-08 12:54:29,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:54:29,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:54:29,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:54:29,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:54:29,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,715 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 231 [2025-03-08 12:54:29,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:54:29,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:54:29,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:54:29,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:54:29,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,742 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 12:54:29,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:54:29,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:54:29,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:54:29,758 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:54:29,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (1/1) ... [2025-03-08 12:54:29,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:54:29,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:54:29,784 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 12:54:29,786 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 12:54:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:54:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:54:29,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:54:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:54:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:54:29,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:54:29,870 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:54:29,872 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:54:30,188 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 12:54:30,189 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:54:30,206 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:54:30,208 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:54:30,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:30 BoogieIcfgContainer [2025-03-08 12:54:30,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:54:30,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:54:30,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:54:30,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:54:30,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:54:29" (1/3) ... [2025-03-08 12:54:30,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e435be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:30, skipping insertion in model container [2025-03-08 12:54:30,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29" (2/3) ... [2025-03-08 12:54:30,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e435be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:30, skipping insertion in model container [2025-03-08 12:54:30,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:30" (3/3) ... [2025-03-08 12:54:30,216 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2025-03-08 12:54:30,225 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:54:30,226 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:54:30,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:54:30,282 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;@7c3132e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:54:30,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:54:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:54:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 12:54:30,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:30,301 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:30,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1568137164, now seen corresponding path program 1 times [2025-03-08 12:54:30,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:54:30,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802655561] [2025-03-08 12:54:30,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:54:30,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:54:30,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:54:30,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:30,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 12:54:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:54:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802655561] [2025-03-08 12:54:30,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802655561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:54:30,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136694211] [2025-03-08 12:54:30,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:30,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:54:30,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:54:30,609 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 12:54:30,611 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 12:54:30,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:54:30,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:54:30,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:30,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:30,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:54:30,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 12:54:30,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:54:30,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136694211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:54:30,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:54:30,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:54:30,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352244123] [2025-03-08 12:54:30,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:54:30,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:54:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:54:30,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:54:30,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:54:30,824 INFO L87 Difference]: Start difference. First operand has 101 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:54:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:30,854 INFO L93 Difference]: Finished difference Result 196 states and 349 transitions. [2025-03-08 12:54:30,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:54:30,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-03-08 12:54:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:30,863 INFO L225 Difference]: With dead ends: 196 [2025-03-08 12:54:30,863 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 12:54:30,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:54:30,869 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:30,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:54:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 12:54:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 12:54:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:54:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2025-03-08 12:54:30,908 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 203 [2025-03-08 12:54:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:30,909 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2025-03-08 12:54:30,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:54:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2025-03-08 12:54:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 12:54:30,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:30,911 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:30,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:54:31,112 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 12:54:31,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:31,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1223776181, now seen corresponding path program 1 times [2025-03-08 12:54:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:54:31,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131451984] [2025-03-08 12:54:31,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:54:31,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:54:31,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:54:31,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:31,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:54:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:54:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131451984] [2025-03-08 12:54:31,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131451984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:54:31,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:54:31,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:54:31,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893398956] [2025-03-08 12:54:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:54:31,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:54:31,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:54:31,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:54:31,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:54:31,544 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:54:31,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:31,864 INFO L93 Difference]: Finished difference Result 295 states and 466 transitions. [2025-03-08 12:54:31,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:54:31,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-03-08 12:54:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:31,868 INFO L225 Difference]: With dead ends: 295 [2025-03-08 12:54:31,868 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 12:54:31,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:54:31,870 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 177 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:31,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 789 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:54:31,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 12:54:31,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2025-03-08 12:54:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 12:54:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 303 transitions. [2025-03-08 12:54:31,897 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 303 transitions. Word has length 203 [2025-03-08 12:54:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:31,898 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 303 transitions. [2025-03-08 12:54:31,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:54:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 303 transitions. [2025-03-08 12:54:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 12:54:31,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:31,900 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:31,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:54:31,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:31,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:31,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1224699702, now seen corresponding path program 1 times [2025-03-08 12:54:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:54:31,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363330209] [2025-03-08 12:54:31,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:54:31,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:54:31,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:54:31,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:31,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:54:32,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:54:32,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363330209] [2025-03-08 12:54:32,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363330209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:54:32,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:54:32,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:54:32,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915759226] [2025-03-08 12:54:32,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:54:32,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:54:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:54:32,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:54:32,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:54:32,030 INFO L87 Difference]: Start difference. First operand 190 states and 303 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:54:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:32,073 INFO L93 Difference]: Finished difference Result 371 states and 595 transitions. [2025-03-08 12:54:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:54:32,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-03-08 12:54:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:32,076 INFO L225 Difference]: With dead ends: 371 [2025-03-08 12:54:32,076 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 12:54:32,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:54:32,077 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:32,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:54:32,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 12:54:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 97. [2025-03-08 12:54:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:54:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2025-03-08 12:54:32,096 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 203 [2025-03-08 12:54:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:32,098 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2025-03-08 12:54:32,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:54:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2025-03-08 12:54:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 12:54:32,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:32,108 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:32,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:54:32,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:32,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:32,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1254252374, now seen corresponding path program 1 times [2025-03-08 12:54:32,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:54:32,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853647576] [2025-03-08 12:54:32,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:32,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:54:32,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:54:32,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:54:32,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:32,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-08 12:54:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:54:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853647576] [2025-03-08 12:54:32,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853647576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:54:32,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834270047] [2025-03-08 12:54:32,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:32,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:54:32,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:54:32,454 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 12:54:32,456 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 12:54:32,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:54:32,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:54:32,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:32,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:32,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 12:54:32,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-08 12:54:33,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:54:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 117 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2025-03-08 12:54:33,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834270047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:54:33,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:54:33,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-08 12:54:33,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738213888] [2025-03-08 12:54:33,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:54:33,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 12:54:33,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:54:33,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 12:54:33,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:54:33,684 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2025-03-08 12:54:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:34,214 INFO L93 Difference]: Finished difference Result 211 states and 318 transitions. [2025-03-08 12:54:34,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 12:54:34,216 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) Word has length 203 [2025-03-08 12:54:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:34,217 INFO L225 Difference]: With dead ends: 211 [2025-03-08 12:54:34,217 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 12:54:34,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2025-03-08 12:54:34,219 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 390 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:34,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 281 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:54:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 12:54:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2025-03-08 12:54:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:54:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-08 12:54:34,234 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 203 [2025-03-08 12:54:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:34,235 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-08 12:54:34,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2025-03-08 12:54:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-08 12:54:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 12:54:34,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:34,237 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:34,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:54:34,441 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,SelfDestructingSolverStorable3 [2025-03-08 12:54:34,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:34,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1806065733, now seen corresponding path program 1 times [2025-03-08 12:54:34,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:54:34,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650570010] [2025-03-08 12:54:34,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:54:34,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 12:54:34,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 12:54:34,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:34,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:54:34,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:54:34,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650570010] [2025-03-08 12:54:34,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650570010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:54:34,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:54:34,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:54:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139942058] [2025-03-08 12:54:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:54:34,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:54:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:54:34,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:54:34,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:54:34,609 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:54:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:34,644 INFO L93 Difference]: Finished difference Result 312 states and 452 transitions. [2025-03-08 12:54:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:54:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2025-03-08 12:54:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:34,646 INFO L225 Difference]: With dead ends: 312 [2025-03-08 12:54:34,646 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 12:54:34,647 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 12:54:34,647 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:34,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 276 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:54:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 12:54:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2025-03-08 12:54:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 120 states have (on average 1.2333333333333334) internal successors, (148), 120 states have internal predecessors, (148), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 12:54:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 276 transitions. [2025-03-08 12:54:34,683 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 276 transitions. Word has length 205 [2025-03-08 12:54:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:34,684 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 276 transitions. [2025-03-08 12:54:34,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:54:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 276 transitions. [2025-03-08 12:54:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 12:54:34,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:34,686 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:34,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:54:34,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:34,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:34,687 INFO L85 PathProgramCache]: Analyzing trace with hash 275087970, now seen corresponding path program 1 times [2025-03-08 12:54:34,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:54:34,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116026004] [2025-03-08 12:54:34,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:34,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:54:34,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 12:54:34,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 12:54:34,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:34,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:54:34,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894025043] [2025-03-08 12:54:34,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:34,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:54:34,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:54:34,790 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 12:54:34,807 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 12:54:34,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 12:54:34,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 12:54:34,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:34,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:54:34,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:54:34,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 12:54:34,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 12:54:34,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:34,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:54:35,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:54:35,076 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:54:35,077 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:54:35,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:54:35,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:54:35,281 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 12:54:35,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:54:35,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:54:35 BoogieIcfgContainer [2025-03-08 12:54:35,393 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:54:35,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:54:35,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:54:35,394 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:54:35,395 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:30" (3/4) ... [2025-03-08 12:54:35,397 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:54:35,397 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:54:35,398 INFO L158 Benchmark]: Toolchain (without parser) took 5986.15ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 103.8MB in the beginning and 215.4MB in the end (delta: -111.6MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2025-03-08 12:54:35,398 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:54:35,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.14ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 88.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:54:35,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.48ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 83.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:54:35,399 INFO L158 Benchmark]: Boogie Preprocessor took 39.33ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 78.8MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:54:35,400 INFO L158 Benchmark]: IcfgBuilder took 450.65ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 47.1MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 12:54:35,400 INFO L158 Benchmark]: TraceAbstraction took 5182.88ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 47.1MB in the beginning and 215.4MB in the end (delta: -168.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:54:35,400 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 310.4MB. Free memory was 215.4MB in the beginning and 215.4MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:54:35,401 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.14ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 88.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.48ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 83.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.33ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 78.8MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 450.65ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 47.1MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5182.88ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 47.1MB in the beginning and 215.4MB in the end (delta: -168.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 310.4MB. Free memory was 215.4MB in the beginning and 215.4MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 198, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 150. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] float var_1_6 = 255.25; [L27] unsigned short int var_1_7 = 16; [L28] signed char var_1_8 = -10; [L29] signed char var_1_9 = -8; [L30] unsigned short int var_1_10 = 8; [L31] unsigned short int var_1_11 = 10000; [L32] unsigned short int var_1_12 = 5; [L33] signed short int var_1_13 = 200; [L34] unsigned char var_1_15 = 0; [L35] unsigned short int var_1_16 = 35895; [L36] unsigned short int var_1_17 = 18336; [L37] unsigned char var_1_18 = 0; [L38] signed long int var_1_19 = -50; [L39] unsigned char var_1_20 = 10; [L40] unsigned char var_1_22 = 100; [L41] unsigned char var_1_23 = 16; [L42] signed long int var_1_24 = -256; [L43] unsigned char var_1_25 = 1; [L44] unsigned char var_1_30 = 25; [L45] signed char var_1_32 = 1; [L46] unsigned char var_1_33 = 200; [L47] unsigned char var_1_34 = 64; [L48] unsigned char var_1_35 = 64; [L49] unsigned char var_1_36 = 8; [L50] unsigned short int var_1_37 = 500; [L51] unsigned char var_1_38 = 32; [L52] unsigned short int var_1_39 = 25; [L53] signed char last_1_var_1_8 = -10; [L54] unsigned char last_1_var_1_15 = 0; [L55] signed long int last_1_var_1_19 = -50; VAL [isInitial=0, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_2=511/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L193] last_1_var_1_8 = var_1_8 [L194] last_1_var_1_15 = var_1_15 [L195] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_2=511/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L143] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L144] var_1_3 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L145] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L146] var_1_4 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L147] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L149] var_1_6 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L150] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L151] var_1_7 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L152] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L153] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L153] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L154] var_1_9 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L155] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L156] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L157] var_1_11 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L158] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L159] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L159] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L160] var_1_12 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L161] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L162] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L163] var_1_16 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L164] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L165] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L165] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L166] var_1_17 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L167] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L168] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L169] var_1_18 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L170] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L171] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L171] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L172] var_1_22 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L173] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_22 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L174] RET assume_abort_if_not(var_1_22 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L175] var_1_32 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_32 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L176] RET assume_abort_if_not(var_1_32 >= -128) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L177] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L177] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L178] CALL assume_abort_if_not(var_1_32 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L178] RET assume_abort_if_not(var_1_32 != 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L179] var_1_33 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_33 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L180] RET assume_abort_if_not(var_1_33 >= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L181] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L182] var_1_34 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L183] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L184] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L185] var_1_35 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_35 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L186] RET assume_abort_if_not(var_1_35 >= 63) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L187] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L188] var_1_36 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L189] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L190] CALL assume_abort_if_not(var_1_36 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L190] RET assume_abort_if_not(var_1_36 <= 63) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L206] RET updateVariables() [L207] CALL step() [L59] COND FALSE !(var_1_7 <= -1) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L62] var_1_23 = var_1_22 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L63] EXPR var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L63] EXPR var_1_8 & (var_1_22 >> var_1_4) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L63] COND TRUE var_1_13 >= (var_1_8 & (var_1_22 >> var_1_4)) [L64] var_1_24 = (var_1_22 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L70] COND TRUE var_1_16 >= (-128 & var_1_11) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L71] COND FALSE !((((((var_1_3) > (var_1_3)) ? (var_1_3) : (var_1_3))) <= var_1_3) && var_1_18) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L77] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L80] COND TRUE ! var_1_15 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L81] COND TRUE (var_1_9 % var_1_32) <= var_1_11 [L82] var_1_30 = (var_1_33 - ((((var_1_34) > ((var_1_35 - var_1_36))) ? (var_1_34) : ((var_1_35 - var_1_36))))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L86] COND FALSE !(((((var_1_1) > (var_1_10)) ? (var_1_1) : (var_1_10))) > var_1_32) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L93] var_1_38 = var_1_34 [L94] var_1_39 = var_1_11 [L95] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_0=1, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L96] COND FALSE !(stepLocal_0 <= last_1_var_1_8) [L103] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L105] COND TRUE (- var_1_7) < (var_1_1 * var_1_4) [L106] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L108] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L115] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14782, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L116] COND FALSE !(var_1_3 != var_1_6) [L123] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14782, var_1_10=8, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L125] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) [L126] unsigned short int stepLocal_4 = var_1_1; [L127] signed long int stepLocal_3 = var_1_7 + (128 + var_1_1); [L128] signed long int stepLocal_2 = - var_1_10; VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14782, stepLocal_2=-18241, stepLocal_3=130, stepLocal_4=-65535, var_1_10=18241, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L129] COND FALSE !(var_1_1 < stepLocal_2) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14782, stepLocal_3=130, stepLocal_4=-65535, var_1_10=18241, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L134] COND TRUE stepLocal_4 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11) [L135] var_1_19 = ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14782, stepLocal_3=130, var_1_10=18241, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= last_1_var_1_8) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_1 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (last_1_var_1_15 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_13 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_1 < (- var_1_10)) ? (((var_1_7 + (128 + var_1_1)) <= last_1_var_1_19) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_1 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18241, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18241, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18241, var_1_11=204799, var_1_12=131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47295, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=204799, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 193 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 6, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 638 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 638 mSDsluCounter, 1783 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1096 mSDsCounter, 281 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 491 IncrementalHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 281 mSolverCounterUnsat, 687 mSDtfsCounter, 491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 118 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1835 NumberOfCodeBlocks, 1835 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 4390 SizeOfPredicates, 4 NumberOfNonLiveVariables, 942 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 15540/15872 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 12:54:35,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_fillercodestructure_filler-ps-ci_file-77.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 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:54:37,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:54:37,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:54:37,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:54:37,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:54:37,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:54:37,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:54:37,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:54:37,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:54:37,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:54:37,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:54:37,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:54:37,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:54:37,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:54:37,371 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:54:37,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:54:37,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:54:37,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:54:37,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:54:37,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:54:37,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:54:37,373 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:54:37,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:54:37,373 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:54:37,373 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:54:37,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:54:37,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:54:37,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:54:37,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:54:37,373 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 -> 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 [2025-03-08 12:54:37,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:54:37,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:54:37,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:54:37,657 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:54:37,658 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:54:37,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2025-03-08 12:54:38,849 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b944c43/a3e51c7673ed40ae9e2c501eb7b804aa/FLAG859fc81cb [2025-03-08 12:54:39,049 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:54:39,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2025-03-08 12:54:39,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b944c43/a3e51c7673ed40ae9e2c501eb7b804aa/FLAG859fc81cb [2025-03-08 12:54:39,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b944c43/a3e51c7673ed40ae9e2c501eb7b804aa [2025-03-08 12:54:39,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:54:39,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:54:39,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:54:39,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:54:39,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:54:39,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f546b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39, skipping insertion in model container [2025-03-08 12:54:39,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:54:39,538 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_fillercodestructure_filler-ps-ci_file-77.i[919,932] [2025-03-08 12:54:39,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:54:39,600 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:54:39,608 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_fillercodestructure_filler-ps-ci_file-77.i[919,932] [2025-03-08 12:54:39,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:54:39,649 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:54:39,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39 WrapperNode [2025-03-08 12:54:39,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:54:39,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:54:39,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:54:39,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:54:39,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,699 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-03-08 12:54:39,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:54:39,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:54:39,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:54:39,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:54:39,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,725 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 12:54:39,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:54:39,755 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:54:39,755 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:54:39,755 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:54:39,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (1/1) ... [2025-03-08 12:54:39,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:54:39,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:54:39,785 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 12:54:39,788 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 12:54:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:54:39,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:54:39,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:54:39,808 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:54:39,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:54:39,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:54:39,877 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:54:39,879 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:54:40,755 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 12:54:40,756 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:54:40,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:54:40,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:54:40,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:40 BoogieIcfgContainer [2025-03-08 12:54:40,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:54:40,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:54:40,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:54:40,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:54:40,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:54:39" (1/3) ... [2025-03-08 12:54:40,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bcf265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:40, skipping insertion in model container [2025-03-08 12:54:40,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:39" (2/3) ... [2025-03-08 12:54:40,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bcf265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:40, skipping insertion in model container [2025-03-08 12:54:40,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:40" (3/3) ... [2025-03-08 12:54:40,775 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2025-03-08 12:54:40,785 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:54:40,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:54:40,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:54:40,840 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;@43fa4e61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:54:40,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:54:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:54:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 12:54:40,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:40,854 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:40,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:40,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash 691211086, now seen corresponding path program 1 times [2025-03-08 12:54:40,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:54:40,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53889514] [2025-03-08 12:54:40,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:40,869 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 12:54:40,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:54:40,871 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 12:54:40,872 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 12:54:40,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 12:54:41,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 12:54:41,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:41,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:41,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:54:41,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2025-03-08 12:54:41,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:54:41,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:54:41,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53889514] [2025-03-08 12:54:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53889514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:54:41,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:54:41,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:54:41,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069042968] [2025-03-08 12:54:41,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:54:41,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:54:41,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:54:41,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:54:41,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:54:41,198 INFO L87 Difference]: Start difference. First operand has 92 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:54:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:41,229 INFO L93 Difference]: Finished difference Result 178 states and 319 transitions. [2025-03-08 12:54:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:54:41,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2025-03-08 12:54:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:41,237 INFO L225 Difference]: With dead ends: 178 [2025-03-08 12:54:41,238 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 12:54:41,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 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 12:54:41,242 INFO L435 NwaCegarLoop]: 140 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, 140 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 12:54:41,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:54:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 12:54:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 12:54:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:54:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 140 transitions. [2025-03-08 12:54:41,272 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 140 transitions. Word has length 201 [2025-03-08 12:54:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:41,273 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 140 transitions. [2025-03-08 12:54:41,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:54:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2025-03-08 12:54:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 12:54:41,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:41,276 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:41,285 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 12:54:41,477 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 12:54:41,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:41,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash -338284785, now seen corresponding path program 1 times [2025-03-08 12:54:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:54:41,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014008500] [2025-03-08 12:54:41,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:41,479 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 12:54:41,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:54:41,481 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 12:54:41,482 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 12:54:41,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 12:54:41,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 12:54:41,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:41,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:41,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:54:41,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2025-03-08 12:54:41,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:54:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-08 12:54:42,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:54:42,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014008500] [2025-03-08 12:54:42,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014008500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:54:42,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:54:42,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 12:54:42,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369574757] [2025-03-08 12:54:42,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:54:42,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:54:42,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:54:42,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:54:42,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:54:42,174 INFO L87 Difference]: Start difference. First operand 89 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-08 12:54:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:42,840 INFO L93 Difference]: Finished difference Result 183 states and 284 transitions. [2025-03-08 12:54:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:54:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 201 [2025-03-08 12:54:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:42,853 INFO L225 Difference]: With dead ends: 183 [2025-03-08 12:54:42,854 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 12:54:42,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:54:42,855 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 188 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:42,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 218 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:54:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 12:54:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2025-03-08 12:54:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:54:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2025-03-08 12:54:42,869 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 201 [2025-03-08 12:54:42,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:42,869 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2025-03-08 12:54:42,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-08 12:54:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2025-03-08 12:54:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 12:54:42,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:42,872 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:42,881 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 (3)] Ended with exit code 0 [2025-03-08 12:54:43,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 12:54:43,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:43,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:43,073 INFO L85 PathProgramCache]: Analyzing trace with hash 905393257, now seen corresponding path program 1 times [2025-03-08 12:54:43,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:54:43,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284156582] [2025-03-08 12:54:43,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:43,073 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 12:54:43,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:54:43,075 INFO L229 MonitoredProcess]: Starting monitored process 4 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 12:54:43,077 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 (4)] Waiting until timeout for monitored process [2025-03-08 12:54:43,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 12:54:43,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 12:54:43,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:43,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:43,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:54:43,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:54:43,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:54:43,580 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:54:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284156582] [2025-03-08 12:54:43,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284156582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:54:43,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:54:43,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:54:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123378329] [2025-03-08 12:54:43,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:54:43,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:54:43,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:54:43,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:54:43,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:54:43,582 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:54:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:43,926 INFO L93 Difference]: Finished difference Result 262 states and 396 transitions. [2025-03-08 12:54:43,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:54:43,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2025-03-08 12:54:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:43,931 INFO L225 Difference]: With dead ends: 262 [2025-03-08 12:54:43,931 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 12:54:43,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 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 12:54:43,932 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 25 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:43,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 258 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:54:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 12:54:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 160. [2025-03-08 12:54:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 91 states have internal predecessors, (111), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 12:54:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 239 transitions. [2025-03-08 12:54:43,967 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 239 transitions. Word has length 202 [2025-03-08 12:54:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:43,968 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 239 transitions. [2025-03-08 12:54:43,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:54:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 239 transitions. [2025-03-08 12:54:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 12:54:43,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:43,971 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:43,979 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 (4)] Ended with exit code 0 [2025-03-08 12:54:44,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 12:54:44,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:44,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash -654743470, now seen corresponding path program 1 times [2025-03-08 12:54:44,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:54:44,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43299499] [2025-03-08 12:54:44,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:44,173 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 12:54:44,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:54:44,176 INFO L229 MonitoredProcess]: Starting monitored process 5 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 12:54:44,177 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 (5)] Waiting until timeout for monitored process [2025-03-08 12:54:44,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:54:44,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:54:44,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:44,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:44,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:54:44,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:54:44,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:54:44,411 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:54:44,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43299499] [2025-03-08 12:54:44,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43299499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:54:44,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:54:44,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:54:44,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433881983] [2025-03-08 12:54:44,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:54:44,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:54:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:54:44,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:54:44,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:54:44,412 INFO L87 Difference]: Start difference. First operand 160 states and 239 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:54:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:44,829 INFO L93 Difference]: Finished difference Result 249 states and 373 transitions. [2025-03-08 12:54:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:54:44,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-03-08 12:54:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:44,841 INFO L225 Difference]: With dead ends: 249 [2025-03-08 12:54:44,841 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 12:54:44,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 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 12:54:44,842 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:44,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:54:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 12:54:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-08 12:54:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.2) internal successors, (108), 90 states have internal predecessors, (108), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 12:54:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 236 transitions. [2025-03-08 12:54:44,857 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 236 transitions. Word has length 203 [2025-03-08 12:54:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:44,857 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 236 transitions. [2025-03-08 12:54:44,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:54:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 236 transitions. [2025-03-08 12:54:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 12:54:44,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:44,859 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:44,868 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 (5)] Ended with exit code 0 [2025-03-08 12:54:45,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 12:54:45,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:45,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash -624267277, now seen corresponding path program 1 times [2025-03-08 12:54:45,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:54:45,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059910491] [2025-03-08 12:54:45,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:45,061 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 12:54:45,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:54:45,064 INFO L229 MonitoredProcess]: Starting monitored process 6 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 12:54:45,065 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 (6)] Waiting until timeout for monitored process [2025-03-08 12:54:45,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:54:45,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:54:45,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:45,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:45,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 12:54:45,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-08 12:54:45,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:54:45,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:54:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059910491] [2025-03-08 12:54:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059910491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:54:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [813677570] [2025-03-08 12:54:45,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:45,951 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:54:45,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:54:45,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:54:45,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-08 12:54:46,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:54:46,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:54:46,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:46,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:46,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 12:54:46,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-08 12:54:46,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:54:47,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [813677570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:54:47,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:54:47,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-08 12:54:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845041561] [2025-03-08 12:54:47,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:54:47,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:54:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:54:47,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:54:47,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:54:47,080 INFO L87 Difference]: Start difference. First operand 159 states and 236 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-08 12:54:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:47,807 INFO L93 Difference]: Finished difference Result 278 states and 395 transitions. [2025-03-08 12:54:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 12:54:47,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 203 [2025-03-08 12:54:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:47,818 INFO L225 Difference]: With dead ends: 278 [2025-03-08 12:54:47,818 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 12:54:47,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:54:47,819 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 109 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:47,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 261 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 12:54:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 12:54:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 175. [2025-03-08 12:54:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 102 states have (on average 1.1568627450980393) internal successors, (118), 102 states have internal predecessors, (118), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 12:54:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 246 transitions. [2025-03-08 12:54:47,837 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 246 transitions. Word has length 203 [2025-03-08 12:54:47,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:47,837 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 246 transitions. [2025-03-08 12:54:47,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-08 12:54:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 246 transitions. [2025-03-08 12:54:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 12:54:47,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:47,839 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:54:47,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2025-03-08 12:54:48,048 INFO L540 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 (6)] Forceful destruction successful, exit code 0 [2025-03-08 12:54:48,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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 12:54:48,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash 887502024, now seen corresponding path program 1 times [2025-03-08 12:54:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:54:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141822730] [2025-03-08 12:54:48,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:48,241 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 12:54:48,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:54:48,243 INFO L229 MonitoredProcess]: Starting monitored process 8 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 12:54:48,244 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 (8)] Waiting until timeout for monitored process [2025-03-08 12:54:48,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 12:54:48,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 12:54:48,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:48,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:48,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 12:54:48,467 INFO L279 TraceCheckSpWp]: Computing forward predicates...