./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 053126c13ef1d8dfef0a099a2c7c76042ecd617980f87b19ee0e26ff48315beb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:27:18,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:27:18,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:27:18,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:27:18,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:27:18,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:27:18,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:27:18,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:27:18,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:27:18,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:27:18,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:27:18,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:27:18,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:27:18,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:27:18,861 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:27:18,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:27:18,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:27:18,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:27:18,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:27:18,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 053126c13ef1d8dfef0a099a2c7c76042ecd617980f87b19ee0e26ff48315beb [2025-02-05 21:27:19,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:27:19,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:27:19,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:27:19,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:27:19,045 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:27:19,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2025-02-05 21:27:20,197 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec77e9456/36854db515a04ca7b5c0334c033bb652/FLAG50f8a1631 [2025-02-05 21:27:20,470 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:27:20,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2025-02-05 21:27:20,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec77e9456/36854db515a04ca7b5c0334c033bb652/FLAG50f8a1631 [2025-02-05 21:27:20,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec77e9456/36854db515a04ca7b5c0334c033bb652 [2025-02-05 21:27:20,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:27:20,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:27:20,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:27:20,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:27:20,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:27:20,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b75528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20, skipping insertion in model container [2025-02-05 21:27:20,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:27:20,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i[915,928] [2025-02-05 21:27:20,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:27:20,703 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:27:20,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i[915,928] [2025-02-05 21:27:20,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:27:20,764 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:27:20,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20 WrapperNode [2025-02-05 21:27:20,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:27:20,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:27:20,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:27:20,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:27:20,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,808 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-02-05 21:27:20,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:27:20,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:27:20,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:27:20,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:27:20,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,848 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:27:20,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:27:20,860 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:27:20,860 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:27:20,860 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:27:20,861 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (1/1) ... [2025-02-05 21:27:20,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:27:20,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:27:20,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:27:20,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:27:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:27:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:27:20,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:27:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:27:20,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:27:20,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:27:20,981 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:27:20,983 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:27:21,241 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L157: havoc property_#t~bitwise17#1; [2025-02-05 21:27:21,267 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-02-05 21:27:21,267 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:27:21,279 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:27:21,279 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:27:21,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:27:21 BoogieIcfgContainer [2025-02-05 21:27:21,279 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:27:21,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:27:21,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:27:21,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:27:21,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:27:20" (1/3) ... [2025-02-05 21:27:21,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fcfb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:27:21, skipping insertion in model container [2025-02-05 21:27:21,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:20" (2/3) ... [2025-02-05 21:27:21,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fcfb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:27:21, skipping insertion in model container [2025-02-05 21:27:21,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:27:21" (3/3) ... [2025-02-05 21:27:21,287 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2025-02-05 21:27:21,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:27:21,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-68.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:27:21,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:27:21,361 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;@19d38113, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:27:21,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:27:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 21:27:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 21:27:21,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:27:21,377 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:27:21,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:27:21,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:27:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash 930211913, now seen corresponding path program 1 times [2025-02-05 21:27:21,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:27:21,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913904592] [2025-02-05 21:27:21,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:21,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:27:21,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 21:27:21,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 21:27:21,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:21,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 21:27:21,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:27:21,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913904592] [2025-02-05 21:27:21,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913904592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:27:21,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142232689] [2025-02-05 21:27:21,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:21,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:27:21,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:27:21,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:27:21,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:27:21,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 21:27:21,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 21:27:21,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:21,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:21,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:27:21,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:27:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 21:27:21,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:27:21,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142232689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:27:21,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:27:21,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:27:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532596283] [2025-02-05 21:27:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:27:21,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:27:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:27:21,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:27:21,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:27:21,938 INFO L87 Difference]: Start difference. First operand has 77 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 21:27:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:27:21,963 INFO L93 Difference]: Finished difference Result 146 states and 250 transitions. [2025-02-05 21:27:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:27:21,965 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2025-02-05 21:27:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:27:21,970 INFO L225 Difference]: With dead ends: 146 [2025-02-05 21:27:21,971 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 21:27:21,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:27:21,978 INFO L435 NwaCegarLoop]: 108 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, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:27:21,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:27:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 21:27:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-05 21:27:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 21:27:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2025-02-05 21:27:22,016 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 150 [2025-02-05 21:27:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:27:22,018 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2025-02-05 21:27:22,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 21:27:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2025-02-05 21:27:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 21:27:22,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:27:22,026 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:27:22,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:27:22,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:27:22,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:27:22,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:27:22,232 INFO L85 PathProgramCache]: Analyzing trace with hash -605830068, now seen corresponding path program 1 times [2025-02-05 21:27:22,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:27:22,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985156386] [2025-02-05 21:27:22,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:22,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:27:22,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 21:27:22,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 21:27:22,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:22,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 21:27:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:27:22,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985156386] [2025-02-05 21:27:22,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985156386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:27:22,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:27:22,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:27:22,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312212391] [2025-02-05 21:27:22,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:27:22,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:27:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:27:22,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:27:22,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:27:22,629 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 21:27:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:27:22,740 INFO L93 Difference]: Finished difference Result 141 states and 213 transitions. [2025-02-05 21:27:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:27:22,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2025-02-05 21:27:22,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:27:22,749 INFO L225 Difference]: With dead ends: 141 [2025-02-05 21:27:22,750 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 21:27:22,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:27:22,752 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 100 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:27:22,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 144 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:27:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 21:27:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-05 21:27:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 21:27:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2025-02-05 21:27:22,769 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 150 [2025-02-05 21:27:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:27:22,770 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2025-02-05 21:27:22,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 21:27:22,771 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2025-02-05 21:27:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 21:27:22,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:27:22,774 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:27:22,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:27:22,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:27:22,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:27:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1890140750, now seen corresponding path program 1 times [2025-02-05 21:27:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:27:22,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550343096] [2025-02-05 21:27:22,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:22,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:27:22,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 21:27:22,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 21:27:22,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:22,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 21:27:23,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:27:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550343096] [2025-02-05 21:27:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550343096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:27:23,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:27:23,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:27:23,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123559178] [2025-02-05 21:27:23,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:27:23,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:27:23,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:27:23,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:27:23,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:27:23,581 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 21:27:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:27:24,003 INFO L93 Difference]: Finished difference Result 260 states and 383 transitions. [2025-02-05 21:27:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:27:24,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2025-02-05 21:27:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:27:24,007 INFO L225 Difference]: With dead ends: 260 [2025-02-05 21:27:24,007 INFO L226 Difference]: Without dead ends: 191 [2025-02-05 21:27:24,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:27:24,008 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 170 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:27:24,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 433 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:27:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-05 21:27:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 133. [2025-02-05 21:27:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 84 states have internal predecessors, (106), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 21:27:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2025-02-05 21:27:24,029 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 198 transitions. Word has length 151 [2025-02-05 21:27:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:27:24,029 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 198 transitions. [2025-02-05 21:27:24,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 21:27:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 198 transitions. [2025-02-05 21:27:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 21:27:24,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:27:24,031 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:27:24,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:27:24,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:27:24,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:27:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1985974615, now seen corresponding path program 1 times [2025-02-05 21:27:24,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:27:24,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475249109] [2025-02-05 21:27:24,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:27:24,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 21:27:24,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 21:27:24,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:24,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 21:27:24,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:27:24,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475249109] [2025-02-05 21:27:24,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475249109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:27:24,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:27:24,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:27:24,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199253262] [2025-02-05 21:27:24,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:27:24,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:27:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:27:24,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:27:24,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:27:24,391 INFO L87 Difference]: Start difference. First operand 133 states and 198 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 21:27:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:27:24,775 INFO L93 Difference]: Finished difference Result 279 states and 405 transitions. [2025-02-05 21:27:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:27:24,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2025-02-05 21:27:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:27:24,777 INFO L225 Difference]: With dead ends: 279 [2025-02-05 21:27:24,777 INFO L226 Difference]: Without dead ends: 210 [2025-02-05 21:27:24,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:27:24,778 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 210 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:27:24,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 472 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:27:24,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-05 21:27:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 138. [2025-02-05 21:27:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 21:27:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 203 transitions. [2025-02-05 21:27:24,799 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 203 transitions. Word has length 152 [2025-02-05 21:27:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:27:24,803 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 203 transitions. [2025-02-05 21:27:24,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 21:27:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 203 transitions. [2025-02-05 21:27:24,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 21:27:24,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:27:24,804 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:27:24,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:27:24,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:27:24,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:27:24,805 INFO L85 PathProgramCache]: Analyzing trace with hash -632664918, now seen corresponding path program 1 times [2025-02-05 21:27:24,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:27:24,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881876414] [2025-02-05 21:27:24,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:24,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:27:24,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 21:27:24,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 21:27:24,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:24,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:27:24,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180233831] [2025-02-05 21:27:24,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:24,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:27:24,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:27:24,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:27:24,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:27:24,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 21:27:24,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 21:27:24,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:24,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:27:24,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 21:27:24,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 21:27:25,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 21:27:25,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:25,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:27:25,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 21:27:25,100 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 21:27:25,101 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 21:27:25,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 21:27:25,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:27:25,305 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-05 21:27:25,374 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 21:27:25,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 09:27:25 BoogieIcfgContainer [2025-02-05 21:27:25,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 21:27:25,377 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 21:27:25,377 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 21:27:25,377 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 21:27:25,378 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:27:21" (3/4) ... [2025-02-05 21:27:25,380 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 21:27:25,380 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 21:27:25,381 INFO L158 Benchmark]: Toolchain (without parser) took 4881.06ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 133.3MB in the beginning and 119.4MB in the end (delta: 13.9MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2025-02-05 21:27:25,381 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:27:25,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.76ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 118.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 21:27:25,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.47ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 115.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:27:25,382 INFO L158 Benchmark]: Boogie Preprocessor took 48.03ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 111.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 21:27:25,382 INFO L158 Benchmark]: IcfgBuilder took 419.80ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 85.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 21:27:25,382 INFO L158 Benchmark]: TraceAbstraction took 4095.35ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 85.3MB in the beginning and 119.5MB in the end (delta: -34.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:27:25,382 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 201.3MB. Free memory was 119.5MB in the beginning and 119.4MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:27:25,383 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.76ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 118.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.47ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 115.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.03ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 111.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 419.80ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 85.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4095.35ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 85.3MB in the beginning and 119.5MB in the end (delta: -34.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 201.3MB. Free memory was 119.5MB in the beginning and 119.4MB in the end (delta: 60.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 157, overapproximation of someUnaryDOUBLEoperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned char var_1_20 = 0; [L39] double var_1_21 = 4.65; [L40] signed long int var_1_22 = 256; [L41] signed long int var_1_23 = 64; [L42] unsigned char var_1_24 = 5; [L43] unsigned char var_1_25 = 2; [L44] signed short int var_1_26 = 10; [L45] double var_1_27 = 16.8; [L46] double var_1_28 = 10.6; [L47] float var_1_29 = 8.25; [L48] signed char var_1_30 = 8; [L49] signed char var_1_31 = 1; [L50] double last_1_var_1_9 = 4.6; [L51] unsigned char last_1_var_1_12 = 100; [L52] unsigned char last_1_var_1_14 = 0; [L53] signed long int last_1_var_1_16 = 0; VAL [isInitial=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L151] last_1_var_1_9 = var_1_9 [L152] last_1_var_1_12 = var_1_12 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L164] RET updateLastVariables() [L165] CALL updateVariables() [L114] var_1_5 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L115] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L116] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L116] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L117] var_1_7 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=32, var_1_9=23/5] [L118] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=32, var_1_9=23/5] [L119] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=32, var_1_9=23/5] [L119] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=32, var_1_9=23/5] [L120] var_1_8 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_9=23/5] [L121] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_9=23/5] [L122] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_9=23/5] [L122] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_9=23/5] [L123] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L123] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L124] var_1_10 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L125] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L126] var_1_13 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L127] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L128] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L128] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L129] var_1_18 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L130] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L131] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L131] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L132] var_1_19 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L133] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L134] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L134] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L135] var_1_20 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L136] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L137] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L137] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L138] var_1_23 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_23 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L139] RET assume_abort_if_not(var_1_23 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L140] CALL assume_abort_if_not(var_1_23 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L140] RET assume_abort_if_not(var_1_23 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L141] var_1_25 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L142] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L143] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L143] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L144] var_1_28 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L145] RET assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L146] var_1_31 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L147] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L148] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L148] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L165] RET updateVariables() [L166] CALL step() [L57] var_1_17 = (var_1_18 || (var_1_19 && var_1_20)) [L58] var_1_21 = -0.5 [L59] var_1_22 = var_1_23 [L60] var_1_24 = var_1_25 [L61] var_1_26 = var_1_25 [L62] var_1_27 = var_1_28 [L63] var_1_29 = var_1_28 [L64] var_1_30 = var_1_31 [L65] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L66] COND FALSE !(\read(last_1_var_1_14)) [L77] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L79] var_1_16 = last_1_var_1_12 [L80] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L81] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L82] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L83] COND FALSE !(stepLocal_5 >= var_1_16) [L86] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L89] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L90] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L90] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L91] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L95] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L96] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L97] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L100] COND TRUE stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1) [L101] var_1_6 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=-255, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L104] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=-255, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L105] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L106] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=-255, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L108] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=-255, var_1_7=-255, var_1_8=3, var_1_9=23/5] [L109] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L110] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=-255, var_1_7=-255, var_1_8=3, var_1_9=3] [L166] RET step() [L167] CALL, EXPR property() [L157] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=-255, var_1_7=-255, var_1_8=3, var_1_9=3] [L157-L158] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=-255, var_1_7=-255, var_1_8=3, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=-255, var_1_7=-255, var_1_8=3, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 1157 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 731 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 616 IncrementalHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 426 mSDtfsCounter, 616 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=4, InterpolantAutomatonStates: 23, 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, 4 MinimizatonAttempts, 130 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1057 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 748 ConstructedInterpolants, 0 QuantifiedInterpolants, 1599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 5016/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 21:27:25,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 053126c13ef1d8dfef0a099a2c7c76042ecd617980f87b19ee0e26ff48315beb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:27:27,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:27:27,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 21:27:27,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:27:27,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:27:27,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:27:27,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:27:27,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:27:27,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:27:27,559 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:27:27,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:27:27,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:27:27,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:27:27,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:27:27,560 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:27:27,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:27:27,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:27:27,560 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:27:27,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:27:27,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:27:27,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:27:27,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:27:27,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:27:27,561 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 21:27:27,561 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 21:27:27,561 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 21:27:27,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:27:27,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:27:27,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:27:27,561 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:27:27,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:27:27,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:27:27,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:27:27,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:27:27,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:27:27,563 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 053126c13ef1d8dfef0a099a2c7c76042ecd617980f87b19ee0e26ff48315beb [2025-02-05 21:27:27,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:27:27,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:27:27,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:27:27,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:27:27,829 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:27:27,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2025-02-05 21:27:29,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64c9c1bbf/dc90f20e029447bdb3cfb833f70b2db0/FLAGf262e7d08 [2025-02-05 21:27:29,360 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:27:29,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2025-02-05 21:27:29,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64c9c1bbf/dc90f20e029447bdb3cfb833f70b2db0/FLAGf262e7d08 [2025-02-05 21:27:29,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64c9c1bbf/dc90f20e029447bdb3cfb833f70b2db0 [2025-02-05 21:27:29,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:27:29,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:27:29,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:27:29,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:27:29,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:27:29,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abace9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29, skipping insertion in model container [2025-02-05 21:27:29,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:27:29,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i[915,928] [2025-02-05 21:27:29,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:27:29,854 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:27:29,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i[915,928] [2025-02-05 21:27:29,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:27:29,899 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:27:29,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29 WrapperNode [2025-02-05 21:27:29,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:27:29,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:27:29,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:27:29,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:27:29,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,937 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2025-02-05 21:27:29,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:27:29,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:27:29,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:27:29,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:27:29,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,961 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:27:29,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,966 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:27:29,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:27:29,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:27:29,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:27:29,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (1/1) ... [2025-02-05 21:27:29,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:27:29,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:27:30,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:27:30,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:27:30,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:27:30,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 21:27:30,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:27:30,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:27:30,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:27:30,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:27:30,109 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:27:30,111 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:27:30,640 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-05 21:27:30,640 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:27:30,653 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:27:30,653 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:27:30,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:27:30 BoogieIcfgContainer [2025-02-05 21:27:30,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:27:30,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:27:30,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:27:30,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:27:30,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:27:29" (1/3) ... [2025-02-05 21:27:30,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3876b15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:27:30, skipping insertion in model container [2025-02-05 21:27:30,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:27:29" (2/3) ... [2025-02-05 21:27:30,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3876b15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:27:30, skipping insertion in model container [2025-02-05 21:27:30,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:27:30" (3/3) ... [2025-02-05 21:27:30,665 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2025-02-05 21:27:30,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:27:30,676 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-68.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:27:30,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:27:30,714 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;@66297e23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:27:30,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:27:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 21:27:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 21:27:30,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:27:30,726 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:27:30,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:27:30,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:27:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash 60260206, now seen corresponding path program 1 times [2025-02-05 21:27:30,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:27:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148311780] [2025-02-05 21:27:30,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:30,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:27:30,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:27:30,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:27:30,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 21:27:30,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 21:27:30,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 21:27:30,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:30,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:30,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:27:30,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:27:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-02-05 21:27:31,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:27:31,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:27:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148311780] [2025-02-05 21:27:31,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148311780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:27:31,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:27:31,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 21:27:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837495123] [2025-02-05 21:27:31,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:27:31,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:27:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:27:31,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:27:31,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:27:31,040 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 21:27:31,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:27:31,055 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2025-02-05 21:27:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:27:31,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2025-02-05 21:27:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:27:31,060 INFO L225 Difference]: With dead ends: 130 [2025-02-05 21:27:31,060 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 21:27:31,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:27:31,064 INFO L435 NwaCegarLoop]: 97 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, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:27:31,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:27:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 21:27:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-05 21:27:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 21:27:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2025-02-05 21:27:31,102 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 147 [2025-02-05 21:27:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:27:31,103 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2025-02-05 21:27:31,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 21:27:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2025-02-05 21:27:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 21:27:31,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:27:31,107 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:27:31,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:27:31,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:27:31,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:27:31,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:27:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash -84682165, now seen corresponding path program 1 times [2025-02-05 21:27:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:27:31,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113938991] [2025-02-05 21:27:31,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:31,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:27:31,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:27:31,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:27:31,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 21:27:31,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 21:27:31,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 21:27:31,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:31,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:31,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:27:31,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:27:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 21:27:31,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:27:31,801 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:27:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113938991] [2025-02-05 21:27:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113938991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:27:31,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:27:31,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:27:31,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580279472] [2025-02-05 21:27:31,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:27:31,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:27:31,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:27:31,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:27:31,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:27:31,803 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 21:27:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:27:33,183 INFO L93 Difference]: Finished difference Result 268 states and 401 transitions. [2025-02-05 21:27:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:27:33,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2025-02-05 21:27:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:27:33,193 INFO L225 Difference]: With dead ends: 268 [2025-02-05 21:27:33,193 INFO L226 Difference]: Without dead ends: 206 [2025-02-05 21:27:33,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:27:33,194 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 176 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:27:33,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 446 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 21:27:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-05 21:27:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 113. [2025-02-05 21:27:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 21:27:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2025-02-05 21:27:33,219 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 147 [2025-02-05 21:27:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:27:33,219 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2025-02-05 21:27:33,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 21:27:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2025-02-05 21:27:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 21:27:33,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:27:33,221 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:27:33,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 21:27:33,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:27:33,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:27:33,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:27:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1881633524, now seen corresponding path program 1 times [2025-02-05 21:27:33,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:27:33,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221505509] [2025-02-05 21:27:33,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:33,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:27:33,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:27:33,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:27:33,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 21:27:33,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 21:27:33,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 21:27:33,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:33,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:33,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 21:27:33,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:27:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 21:27:33,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:27:33,625 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:27:33,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221505509] [2025-02-05 21:27:33,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221505509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:27:33,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:27:33,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:27:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881720792] [2025-02-05 21:27:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:27:33,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:27:33,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:27:33,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:27:33,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:27:33,626 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 21:27:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:27:34,354 INFO L93 Difference]: Finished difference Result 175 states and 265 transitions. [2025-02-05 21:27:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:27:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2025-02-05 21:27:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:27:34,373 INFO L225 Difference]: With dead ends: 175 [2025-02-05 21:27:34,373 INFO L226 Difference]: Without dead ends: 113 [2025-02-05 21:27:34,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:27:34,373 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 91 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:27:34,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 171 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:27:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-05 21:27:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-05 21:27:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 21:27:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2025-02-05 21:27:34,402 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 147 [2025-02-05 21:27:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:27:34,403 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2025-02-05 21:27:34,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 21:27:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2025-02-05 21:27:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 21:27:34,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:27:34,405 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:27:34,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 21:27:34,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:27:34,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:27:34,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:27:34,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1170514520, now seen corresponding path program 1 times [2025-02-05 21:27:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:27:34,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535610031] [2025-02-05 21:27:34,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:34,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:27:34,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:27:34,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:27:34,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 21:27:34,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 21:27:34,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 21:27:34,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:34,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:34,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 21:27:34,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:27:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 63 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-02-05 21:27:35,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:27:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 21:27:35,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:27:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535610031] [2025-02-05 21:27:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535610031] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:27:35,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:27:35,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-02-05 21:27:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973172287] [2025-02-05 21:27:35,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 21:27:35,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:27:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:27:35,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:27:35,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:27:35,230 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-05 21:27:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:27:35,880 INFO L93 Difference]: Finished difference Result 191 states and 277 transitions. [2025-02-05 21:27:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:27:35,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 148 [2025-02-05 21:27:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:27:35,890 INFO L225 Difference]: With dead ends: 191 [2025-02-05 21:27:35,890 INFO L226 Difference]: Without dead ends: 129 [2025-02-05 21:27:35,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:27:35,891 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 25 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:27:35,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 273 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:27:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-05 21:27:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2025-02-05 21:27:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 21:27:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2025-02-05 21:27:35,919 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 148 [2025-02-05 21:27:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:27:35,920 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2025-02-05 21:27:35,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-05 21:27:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2025-02-05 21:27:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 21:27:35,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:27:35,921 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:27:35,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-05 21:27:36,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:27:36,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:27:36,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:27:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash 283010839, now seen corresponding path program 1 times [2025-02-05 21:27:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:27:36,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918219036] [2025-02-05 21:27:36,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:36,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:27:36,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:27:36,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:27:36,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-05 21:27:36,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 21:27:36,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 21:27:36,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:36,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:36,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 21:27:36,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:27:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 395 proven. 108 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2025-02-05 21:27:37,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:27:38,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:27:38,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918219036] [2025-02-05 21:27:38,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918219036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:27:38,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [750458155] [2025-02-05 21:27:38,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:27:38,022 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 21:27:38,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 21:27:38,045 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 21:27:38,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-02-05 21:27:38,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 21:27:38,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 21:27:38,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:27:38,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:27:38,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 21:27:38,902 INFO L279 TraceCheckSpWp]: Computing forward predicates...