./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-19.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 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:27:31,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:27:32,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:27:32,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:27:32,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:27:32,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:27:32,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:27:32,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:27:32,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:27:32,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:27:32,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:27:32,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:27:32,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:27:32,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:27:32,048 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:27:32,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:27:32,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:27:32,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:27:32,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:27:32,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:27:32,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:27:32,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:27:32,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:27:32,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:27:32,049 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:27:32,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:27:32,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:27:32,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:27:32,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:27:32,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:27:32,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:27:32,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:27:32,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:27:32,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:27:32,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:27:32,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:27:32,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:27:32,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:27:32,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:27:32,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:27:32,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:27:32,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:27:32,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:27:32,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:27:32,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:27:32,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:27:32,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:27:32,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:27:32,052 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 -> 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 [2025-01-09 09:27:32,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:27:32,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:27:32,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:27:32,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:27:32,317 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:27:32,319 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-19.i [2025-01-09 09:27:33,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/312dfeea8/426fcc6682194562ab92855724dbe470/FLAGda2c0ed6f [2025-01-09 09:27:33,819 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:27:33,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2025-01-09 09:27:33,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/312dfeea8/426fcc6682194562ab92855724dbe470/FLAGda2c0ed6f [2025-01-09 09:27:34,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/312dfeea8/426fcc6682194562ab92855724dbe470 [2025-01-09 09:27:34,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:27:34,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:27:34,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:27:34,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:27:34,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:27:34,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34, skipping insertion in model container [2025-01-09 09:27:34,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:27:34,182 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-19.i[915,928] [2025-01-09 09:27:34,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:27:34,240 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:27:34,246 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-19.i[915,928] [2025-01-09 09:27:34,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:27:34,287 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:27:34,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34 WrapperNode [2025-01-09 09:27:34,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:27:34,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:27:34,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:27:34,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:27:34,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,347 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2025-01-09 09:27:34,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:27:34,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:27:34,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:27:34,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:27:34,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,374 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-01-09 09:27:34,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:27:34,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:27:34,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:27:34,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:27:34,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (1/1) ... [2025-01-09 09:27:34,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:27:34,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:27:34,422 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-01-09 09:27:34,425 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-01-09 09:27:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:27:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:27:34,446 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:27:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:27:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:27:34,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:27:34,498 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:27:34,500 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:27:34,722 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 09:27:34,722 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:27:34,731 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:27:34,731 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:27:34,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:34 BoogieIcfgContainer [2025-01-09 09:27:34,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:27:34,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:27:34,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:27:34,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:27:34,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:27:34" (1/3) ... [2025-01-09 09:27:34,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c3f185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:34, skipping insertion in model container [2025-01-09 09:27:34,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:34" (2/3) ... [2025-01-09 09:27:34,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c3f185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:34, skipping insertion in model container [2025-01-09 09:27:34,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:34" (3/3) ... [2025-01-09 09:27:34,746 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2025-01-09 09:27:34,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:27:34,764 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:27:34,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:27:34,810 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;@4c988e46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:27:34,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:27:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 09:27:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 09:27:34,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:27:34,821 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:27:34,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:27:34,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:27:34,825 INFO L85 PathProgramCache]: Analyzing trace with hash -464241808, now seen corresponding path program 1 times [2025-01-09 09:27:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:27:34,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507836081] [2025-01-09 09:27:34,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:27:34,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:27:34,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:27:34,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:34,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:27:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 09:27:35,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:27:35,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507836081] [2025-01-09 09:27:35,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507836081] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:27:35,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982990569] [2025-01-09 09:27:35,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:35,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:27:35,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:27:35,108 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-01-09 09:27:35,112 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-01-09 09:27:35,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:27:35,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:27:35,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:35,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:27:35,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:27:35,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:27:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 09:27:35,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:27:35,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982990569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:27:35,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:27:35,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:27:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475425278] [2025-01-09 09:27:35,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:27:35,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:27:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:27:35,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:27:35,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:27:35,283 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 09:27:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:27:35,301 INFO L93 Difference]: Finished difference Result 142 states and 248 transitions. [2025-01-09 09:27:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:27:35,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2025-01-09 09:27:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:27:35,306 INFO L225 Difference]: With dead ends: 142 [2025-01-09 09:27:35,306 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 09:27:35,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-01-09 09:27:35,310 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-01-09 09:27:35,311 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-01-09 09:27:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 09:27:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-09 09:27:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 09:27:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2025-01-09 09:27:35,349 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 171 [2025-01-09 09:27:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:27:35,349 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2025-01-09 09:27:35,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 09:27:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2025-01-09 09:27:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 09:27:35,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:27:35,353 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:27:35,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:27:35,557 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-01-09 09:27:35,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:27:35,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:27:35,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1325818810, now seen corresponding path program 1 times [2025-01-09 09:27:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:27:35,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101814246] [2025-01-09 09:27:35,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:35,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:27:35,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:27:35,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:27:35,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:35,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:27:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:27:36,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:27:36,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101814246] [2025-01-09 09:27:36,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101814246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:27:36,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:27:36,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:27:36,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682407594] [2025-01-09 09:27:36,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:27:36,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:27:36,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:27:36,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:27:36,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:27:36,046 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:27:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:27:36,198 INFO L93 Difference]: Finished difference Result 222 states and 339 transitions. [2025-01-09 09:27:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:27:36,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-01-09 09:27:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:27:36,200 INFO L225 Difference]: With dead ends: 222 [2025-01-09 09:27:36,200 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 09:27:36,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-01-09 09:27:36,201 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 81 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:27:36,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 323 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:27:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 09:27:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 137. [2025-01-09 09:27:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 09:27:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2025-01-09 09:27:36,225 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 171 [2025-01-09 09:27:36,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:27:36,225 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2025-01-09 09:27:36,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:27:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2025-01-09 09:27:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 09:27:36,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:27:36,231 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:27:36,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:27:36,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:27:36,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:27:36,231 INFO L85 PathProgramCache]: Analyzing trace with hash 314701560, now seen corresponding path program 1 times [2025-01-09 09:27:36,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:27:36,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988297631] [2025-01-09 09:27:36,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:36,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:27:36,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:27:36,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:27:36,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:36,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:27:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:27:36,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:27:36,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988297631] [2025-01-09 09:27:36,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988297631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:27:36,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:27:36,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:27:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879989492] [2025-01-09 09:27:36,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:27:36,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:27:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:27:36,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:27:36,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:27:36,503 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:27:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:27:36,554 INFO L93 Difference]: Finished difference Result 339 states and 522 transitions. [2025-01-09 09:27:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:27:36,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-01-09 09:27:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:27:36,557 INFO L225 Difference]: With dead ends: 339 [2025-01-09 09:27:36,557 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 09:27:36,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:27:36,560 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 55 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:27:36,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 204 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:27:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 09:27:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2025-01-09 09:27:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 118 states have internal predecessors, (148), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 09:27:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 310 transitions. [2025-01-09 09:27:36,600 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 310 transitions. Word has length 171 [2025-01-09 09:27:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:27:36,601 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 310 transitions. [2025-01-09 09:27:36,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:27:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 310 transitions. [2025-01-09 09:27:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 09:27:36,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:27:36,604 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:27:36,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:27:36,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:27:36,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:27:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash -272104454, now seen corresponding path program 1 times [2025-01-09 09:27:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:27:36,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744987272] [2025-01-09 09:27:36,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:27:36,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:27:36,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:27:36,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:36,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:27:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-01-09 09:27:36,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:27:36,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744987272] [2025-01-09 09:27:36,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744987272] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:27:36,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784867683] [2025-01-09 09:27:36,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:36,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:27:36,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:27:36,984 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-01-09 09:27:36,987 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-01-09 09:27:37,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:27:37,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:27:37,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:37,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:27:37,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:27:37,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:27:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 708 proven. 45 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-01-09 09:27:37,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:27:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-01-09 09:27:37,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784867683] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:27:37,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:27:37,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-09 09:27:37,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933400981] [2025-01-09 09:27:37,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:27:37,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:27:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:27:37,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:27:37,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:27:37,755 INFO L87 Difference]: Start difference. First operand 203 states and 310 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 09:27:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:27:38,029 INFO L93 Difference]: Finished difference Result 361 states and 538 transitions. [2025-01-09 09:27:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:27:38,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 171 [2025-01-09 09:27:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:27:38,032 INFO L225 Difference]: With dead ends: 361 [2025-01-09 09:27:38,032 INFO L226 Difference]: Without dead ends: 227 [2025-01-09 09:27:38,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 339 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:27:38,034 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 124 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:27:38,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 167 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:27:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-09 09:27:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2025-01-09 09:27:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 127 states have (on average 1.220472440944882) internal successors, (155), 127 states have internal predecessors, (155), 81 states have call successors, (81), 6 states have call predecessors, (81), 6 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 09:27:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 317 transitions. [2025-01-09 09:27:38,075 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 317 transitions. Word has length 171 [2025-01-09 09:27:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:27:38,075 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 317 transitions. [2025-01-09 09:27:38,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 09:27:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 317 transitions. [2025-01-09 09:27:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 09:27:38,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:27:38,077 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:27:38,083 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-01-09 09:27:38,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:27:38,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:27:38,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:27:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1502902908, now seen corresponding path program 1 times [2025-01-09 09:27:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:27:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737277444] [2025-01-09 09:27:38,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:38,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:27:38,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:27:38,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:27:38,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:38,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:27:38,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:27:38,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:27:38,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:27:38,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:38,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:27:38,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:27:38,518 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:27:38,519 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:27:38,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:27:38,523 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 09:27:38,613 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:27:38,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:27:38 BoogieIcfgContainer [2025-01-09 09:27:38,615 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:27:38,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:27:38,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:27:38,616 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:27:38,616 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:34" (3/4) ... [2025-01-09 09:27:38,617 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:27:38,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:27:38,619 INFO L158 Benchmark]: Toolchain (without parser) took 4556.19ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 104.7MB in the beginning and 231.9MB in the end (delta: -127.3MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2025-01-09 09:27:38,619 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:27:38,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.19ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 89.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:27:38,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.98ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 84.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:27:38,619 INFO L158 Benchmark]: Boogie Preprocessor took 50.85ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 72.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:27:38,619 INFO L158 Benchmark]: RCFGBuilder took 332.12ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 46.0MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:27:38,620 INFO L158 Benchmark]: TraceAbstraction took 3881.44ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 45.2MB in the beginning and 232.0MB in the end (delta: -186.8MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2025-01-09 09:27:38,620 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 335.5MB. Free memory was 232.0MB in the beginning and 231.9MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:27:38,621 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.41ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.19ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 89.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.98ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 84.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.85ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 72.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 332.12ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 46.0MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3881.44ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 45.2MB in the beginning and 232.0MB in the end (delta: -186.8MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 335.5MB. Free memory was 232.0MB in the beginning and 231.9MB in the end (delta: 106.2kB). 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 136, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someUnaryDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someUnaryFLOAToperation at line 70, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] signed short int var_1_6 = -16; [L26] unsigned short int var_1_7 = 56838; [L27] unsigned short int var_1_8 = 24612; [L28] signed short int var_1_9 = 20013; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 0; [L32] signed short int var_1_14 = 50; [L33] unsigned char var_1_15 = 0; [L34] signed short int var_1_19 = 100; [L35] double var_1_21 = 3.5; [L36] signed short int var_1_23 = -128; [L37] float var_1_24 = 10.2; [L38] float var_1_25 = 8.6; [L39] float var_1_26 = 32.7; [L40] float var_1_27 = 16.25; [L41] float var_1_28 = 8.875; [L42] unsigned short int var_1_29 = 256; [L43] double var_1_30 = 2.75; [L44] double var_1_31 = 0.0; [L45] unsigned char var_1_32 = 8; [L46] unsigned char var_1_33 = 100; [L47] double var_1_34 = 0.19999999999999996; [L48] signed char var_1_35 = -32; [L49] signed char var_1_36 = -1; [L50] signed char var_1_37 = -8; [L51] unsigned char last_1_var_1_15 = 0; VAL [isInitial=0, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=128, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L154] isInitial = 1 [L155] FCALL initially() [L157] CALL updateLastVariables() [L147] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=128, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L157] RET updateLastVariables() [L158] CALL updateVariables() [L102] var_1_2 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L103] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L104] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L104] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L105] var_1_3 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L106] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L107] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L107] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L108] var_1_7 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L109] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L110] CALL assume_abort_if_not(var_1_7 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L110] RET assume_abort_if_not(var_1_7 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L111] var_1_8 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L112] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L113] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L113] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L114] var_1_9 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_9 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L115] RET assume_abort_if_not(var_1_9 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L116] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L116] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L117] var_1_12 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L118] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L119] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L119] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L120] var_1_13 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L121] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L122] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L122] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L123] var_1_21 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L124] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L125] CALL assume_abort_if_not(var_1_21 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L125] RET assume_abort_if_not(var_1_21 != 0.0F) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L126] var_1_23 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_23 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L127] RET assume_abort_if_not(var_1_23 >= -16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L128] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L128] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L129] var_1_25 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L130] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L131] var_1_26 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L132] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L133] var_1_27 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L134] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L135] var_1_28 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_28 >= 0.0F && 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_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L136] RET assume_abort_if_not((var_1_28 >= 0.0F && 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_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L137] var_1_31 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L138] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L139] var_1_33 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L140] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L141] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=0, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=0, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L141] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=0, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L142] var_1_37 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_37 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=0, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=0, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L143] RET assume_abort_if_not(var_1_37 >= -127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=0, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L144] CALL assume_abort_if_not(var_1_37 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=0, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=0, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L144] RET assume_abort_if_not(var_1_37 <= 126) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=0, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L158] RET updateVariables() [L159] CALL step() [L55] var_1_30 = ((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) [L56] var_1_32 = var_1_33 [L57] var_1_34 = var_1_31 [L58] var_1_35 = -1 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L59] COND FALSE !(var_1_31 <= var_1_34) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L64] COND FALSE !(\read(last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L67] COND FALSE !(\read(var_1_10)) [L70] var_1_24 = ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L72] COND TRUE (- var_1_24) == (var_1_24 + var_1_24) [L73] var_1_15 = var_1_12 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L75] COND FALSE !(var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) [L82] var_1_19 = var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L84] COND TRUE var_1_24 != var_1_24 [L85] var_1_29 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L87] signed long int stepLocal_1 = var_1_7 - (var_1_8 - var_1_2); VAL [isInitial=1, last_1_var_1_15=0, stepLocal_1=127, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L88] COND TRUE stepLocal_1 >= var_1_29 [L89] var_1_6 = (var_1_3 - (var_1_9 - var_1_2)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-32513, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L91] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-32513, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L94] signed long int stepLocal_0 = var_1_2 - var_1_3; VAL [isInitial=1, last_1_var_1_15=0, stepLocal_0=1, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-32513, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L95] COND TRUE stepLocal_0 <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6))) [L96] var_1_1 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=128, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-32513, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L159] RET step() [L160] CALL, EXPR property() [L150-L151] return (((((((((var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6)))) ? (var_1_1 == ((signed long int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : (var_1_1 == ((signed long int) var_1_2))) && (((var_1_7 - (var_1_8 - var_1_2)) >= var_1_29) ? (var_1_6 == ((signed short int) (var_1_3 - (var_1_9 - var_1_2)))) : 1)) && (last_1_var_1_15 ? (var_1_10 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && (var_1_15 ? (var_1_14 == ((signed short int) (((((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) < (var_1_9)) ? ((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) : (var_1_9))))) : 1)) && (((- var_1_24) == (var_1_24 + var_1_24)) ? (var_1_15 == ((unsigned char) var_1_12)) : 1)) && ((var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) ? (var_1_10 ? (var_1_19 == ((signed short int) (var_1_3 + ((((var_1_2) < (var_1_23)) ? (var_1_2) : (var_1_23)))))) : (var_1_19 == ((signed short int) (var_1_3 - 8)))) : (var_1_19 == ((signed short int) var_1_2)))) && (var_1_10 ? (var_1_24 == ((float) ((((var_1_25) > (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))) ? (var_1_25) : (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))))) : (var_1_24 == ((float) ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))))))) && ((var_1_24 != var_1_24) ? (var_1_29 == ((unsigned short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=128, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-32513, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L160] RET, EXPR property() [L160] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=128, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-32513, var_1_7=32767, var_1_8=32767, var_1_9=32766] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=128, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=0, var_1_33=0, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=126, var_1_6=-32513, var_1_7=32767, var_1_8=32767, var_1_9=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 802 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 409 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 518 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=4, InterpolantAutomatonStates: 19, 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, 31 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1197 NumberOfCodeBlocks, 1197 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1190 ConstructedInterpolants, 0 QuantifiedInterpolants, 2494 SizeOfPredicates, 2 NumberOfNonLiveVariables, 800 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 9641/9828 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-01-09 09:27:38,636 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-19.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 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:27:40,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:27:40,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:27:40,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:27:40,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:27:40,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:27:40,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:27:40,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:27:40,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:27:40,782 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:27:40,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:27:40,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:27:40,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:27:40,783 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:27:40,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:27:40,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:27:40,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:27:40,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:27:40,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:27:40,786 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:27:40,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:27:40,787 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:27:40,787 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:27:40,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:27:40,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:27:40,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:27:40,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:27:40,787 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 -> 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 [2025-01-09 09:27:41,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:27:41,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:27:41,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:27:41,042 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:27:41,043 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:27:41,043 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-19.i [2025-01-09 09:27:42,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43dfba11e/321ac12260094e888b01b230234a21d5/FLAG0818187c2 [2025-01-09 09:27:42,521 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:27:42,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2025-01-09 09:27:42,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43dfba11e/321ac12260094e888b01b230234a21d5/FLAG0818187c2 [2025-01-09 09:27:42,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43dfba11e/321ac12260094e888b01b230234a21d5 [2025-01-09 09:27:42,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:27:42,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:27:42,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:27:42,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:27:42,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:27:42,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7cdf02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42, skipping insertion in model container [2025-01-09 09:27:42,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:27:42,685 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-19.i[915,928] [2025-01-09 09:27:42,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:27:42,767 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:27:42,776 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-19.i[915,928] [2025-01-09 09:27:42,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:27:42,827 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:27:42,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42 WrapperNode [2025-01-09 09:27:42,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:27:42,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:27:42,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:27:42,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:27:42,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,880 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-01-09 09:27:42,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:27:42,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:27:42,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:27:42,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:27:42,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,917 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-01-09 09:27:42,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:27:42,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:27:42,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:27:42,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:27:42,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (1/1) ... [2025-01-09 09:27:42,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:27:42,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:27:42,988 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-01-09 09:27:42,991 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-01-09 09:27:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:27:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:27:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:27:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:27:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:27:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:27:43,080 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:27:43,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:27:56,109 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 09:27:56,109 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:27:56,118 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:27:56,120 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:27:56,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:56 BoogieIcfgContainer [2025-01-09 09:27:56,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:27:56,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:27:56,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:27:56,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:27:56,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:27:42" (1/3) ... [2025-01-09 09:27:56,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f2033a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:56, skipping insertion in model container [2025-01-09 09:27:56,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:42" (2/3) ... [2025-01-09 09:27:56,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f2033a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:56, skipping insertion in model container [2025-01-09 09:27:56,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:56" (3/3) ... [2025-01-09 09:27:56,130 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2025-01-09 09:27:56,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:27:56,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:27:56,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:27:56,183 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;@1d5193b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:27:56,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:27:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 09:27:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 09:27:56,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:27:56,198 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:27:56,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:27:56,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:27:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash -464241808, now seen corresponding path program 1 times [2025-01-09 09:27:56,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:27:56,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258208537] [2025-01-09 09:27:56,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:56,214 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-01-09 09:27:56,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:27:56,217 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-01-09 09:27:56,219 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-01-09 09:27:56,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:27:57,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:27:57,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:57,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:27:57,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:27:57,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:27:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-01-09 09:27:57,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:27:57,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:27:57,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258208537] [2025-01-09 09:27:57,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258208537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:27:57,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:27:57,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:27:57,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139745573] [2025-01-09 09:27:57,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:27:57,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:27:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:27:57,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:27:57,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:27:57,144 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 09:27:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:27:57,160 INFO L93 Difference]: Finished difference Result 142 states and 248 transitions. [2025-01-09 09:27:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:27:57,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2025-01-09 09:27:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:27:57,165 INFO L225 Difference]: With dead ends: 142 [2025-01-09 09:27:57,165 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 09:27:57,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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-01-09 09:27:57,168 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-01-09 09:27:57,169 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-01-09 09:27:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 09:27:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-09 09:27:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 09:27:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2025-01-09 09:27:57,192 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 171 [2025-01-09 09:27:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:27:57,193 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2025-01-09 09:27:57,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 09:27:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2025-01-09 09:27:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 09:27:57,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:27:57,197 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:27:57,216 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-01-09 09:27:57,401 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-01-09 09:27:57,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:27:57,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:27:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1325818810, now seen corresponding path program 1 times [2025-01-09 09:27:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:27:57,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649017004] [2025-01-09 09:27:57,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:57,404 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-01-09 09:27:57,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:27:57,406 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-01-09 09:27:57,408 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-01-09 09:27:57,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:27:58,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:27:58,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:58,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:27:58,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 09:27:58,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:28:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:28:03,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:28:03,519 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:28:03,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649017004] [2025-01-09 09:28:03,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649017004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:28:03,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:28:03,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:28:03,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19767267] [2025-01-09 09:28:03,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:28:03,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:28:03,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:28:03,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:28:03,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:28:03,521 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:28:08,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:28:12,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:28:16,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:28:20,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:28:24,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:28:28,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:28:32,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:28:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:28:32,849 INFO L93 Difference]: Finished difference Result 233 states and 353 transitions. [2025-01-09 09:28:32,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:28:32,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-01-09 09:28:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:28:33,000 INFO L225 Difference]: With dead ends: 233 [2025-01-09 09:28:33,001 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 09:28:33,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:28:33,004 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 91 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 59 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:28:33,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 335 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 8 Invalid, 7 Unknown, 0 Unchecked, 29.2s Time] [2025-01-09 09:28:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 09:28:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 137. [2025-01-09 09:28:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 09:28:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2025-01-09 09:28:33,057 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 171 [2025-01-09 09:28:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:28:33,058 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2025-01-09 09:28:33,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:28:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2025-01-09 09:28:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 09:28:33,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:28:33,064 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:28:33,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:28:33,264 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-01-09 09:28:33,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:28:33,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:28:33,268 INFO L85 PathProgramCache]: Analyzing trace with hash 314701560, now seen corresponding path program 1 times [2025-01-09 09:28:33,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:28:33,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713782956] [2025-01-09 09:28:33,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:28:33,269 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-01-09 09:28:33,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:28:33,278 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-01-09 09:28:33,278 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-01-09 09:28:33,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:28:34,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:28:34,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:28:34,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:28:34,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:28:34,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:28:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:28:39,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:28:39,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:28:39,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713782956] [2025-01-09 09:28:39,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713782956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:28:39,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:28:39,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:28:39,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978945833] [2025-01-09 09:28:39,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:28:39,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:28:39,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:28:39,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:28:39,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:28:39,635 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:28:44,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:28:48,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:28:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:28:48,674 INFO L93 Difference]: Finished difference Result 405 states and 624 transitions. [2025-01-09 09:28:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:28:48,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-01-09 09:28:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:28:48,826 INFO L225 Difference]: With dead ends: 405 [2025-01-09 09:28:48,826 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 09:28:48,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:28:48,831 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 25 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:28:48,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 205 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2025-01-09 09:28:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 09:28:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2025-01-09 09:28:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 156 states have internal predecessors, (196), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 09:28:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 412 transitions. [2025-01-09 09:28:48,879 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 412 transitions. Word has length 171 [2025-01-09 09:28:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:28:48,879 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 412 transitions. [2025-01-09 09:28:48,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:28:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 412 transitions. [2025-01-09 09:28:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 09:28:48,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:28:48,881 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:28:48,903 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 (4)] Forceful destruction successful, exit code 0 [2025-01-09 09:28:49,082 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-01-09 09:28:49,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:28:49,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:28:49,083 INFO L85 PathProgramCache]: Analyzing trace with hash -272104454, now seen corresponding path program 1 times [2025-01-09 09:28:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:28:49,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64945516] [2025-01-09 09:28:49,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:28:49,083 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-01-09 09:28:49,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:28:49,086 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-01-09 09:28:49,087 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-01-09 09:28:49,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:28:49,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:28:49,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:28:49,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:28:49,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:28:49,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:28:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:28:50,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:28:50,184 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:28:50,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64945516] [2025-01-09 09:28:50,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64945516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:28:50,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:28:50,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:28:50,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192653033] [2025-01-09 09:28:50,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:28:50,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:28:50,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:28:50,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:28:50,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:28:50,186 INFO L87 Difference]: Start difference. First operand 269 states and 412 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:28:53,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 09:28:57,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 09:29:02,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 09:29:06,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 09:29:10,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 09:29:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:29:11,042 INFO L93 Difference]: Finished difference Result 783 states and 1200 transitions. [2025-01-09 09:29:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:29:11,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-01-09 09:29:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:29:11,055 INFO L225 Difference]: With dead ends: 783 [2025-01-09 09:29:11,056 INFO L226 Difference]: Without dead ends: 517 [2025-01-09 09:29:11,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:29:11,058 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 96 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:29:11,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 285 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 20.8s Time] [2025-01-09 09:29:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-09 09:29:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 273. [2025-01-09 09:29:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 160 states have (on average 1.25) internal successors, (200), 160 states have internal predecessors, (200), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 09:29:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 416 transitions. [2025-01-09 09:29:11,102 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 416 transitions. Word has length 171 [2025-01-09 09:29:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:29:11,103 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 416 transitions. [2025-01-09 09:29:11,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:29:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 416 transitions. [2025-01-09 09:29:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 09:29:11,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:29:11,106 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:29:11,145 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-01-09 09:29:11,306 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-01-09 09:29:11,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:29:11,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:29:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash -665131464, now seen corresponding path program 1 times [2025-01-09 09:29:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:29:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935769651] [2025-01-09 09:29:11,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:29:11,310 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-01-09 09:29:11,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:29:11,312 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-01-09 09:29:11,314 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-01-09 09:29:11,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 09:29:12,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 09:29:12,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:29:12,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:29:12,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 09:29:12,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:29:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 708 proven. 45 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-01-09 09:29:15,776 INFO L312 TraceCheckSpWp]: Computing backward predicates...