./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.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-25_file-53.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 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:55:25,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:55:25,732 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:55:25,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:55:25,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:55:25,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:55:25,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:55:25,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:55:25,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:55:25,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:55:25,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:55:25,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:55:25,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:55:25,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:55:25,768 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:55:25,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:55:25,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:55:25,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:55:25,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:55:25,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:55:25,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:55:25,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:55:25,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:55:25,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:55:25,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:55:25,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:55:25,772 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:55:25,772 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:55:25,772 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:55:25,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:55:25,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:55:25,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:55:25,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:55:25,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:55:25,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:55:25,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:55:25,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:55:25,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:55:25,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:55:25,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:55:25,774 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:55:25,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:55:25,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:55:25,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:55:25,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:55:25,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:55:25,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:55:25,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:55:25,775 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 -> 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd [2025-01-09 09:55:26,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:55:26,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:55:26,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:55:26,064 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:55:26,064 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:55:26,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-01-09 09:55:27,399 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/862837df3/e5a1eb8df21b4bc08fe6bb8425930579/FLAG44a44a019 [2025-01-09 09:55:27,701 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:55:27,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-01-09 09:55:27,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/862837df3/e5a1eb8df21b4bc08fe6bb8425930579/FLAG44a44a019 [2025-01-09 09:55:27,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/862837df3/e5a1eb8df21b4bc08fe6bb8425930579 [2025-01-09 09:55:27,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:55:27,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:55:27,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:55:27,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:55:27,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:55:27,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:55:27" (1/1) ... [2025-01-09 09:55:27,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57463a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:27, skipping insertion in model container [2025-01-09 09:55:27,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:55:27" (1/1) ... [2025-01-09 09:55:28,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:55:28,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i[915,928] [2025-01-09 09:55:28,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:55:28,233 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:55:28,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i[915,928] [2025-01-09 09:55:28,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:55:28,298 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:55:28,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28 WrapperNode [2025-01-09 09:55:28,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:55:28,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:55:28,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:55:28,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:55:28,308 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:55:28" (1/1) ... [2025-01-09 09:55:28,320 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:55:28" (1/1) ... [2025-01-09 09:55:28,370 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-01-09 09:55:28,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:55:28,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:55:28,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:55:28,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:55:28,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,403 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:55:28,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:55:28,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:55:28,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:55:28,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:55:28,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (1/1) ... [2025-01-09 09:55:28,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:55:28,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:55:28,471 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:55:28,474 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:55:28,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:55:28,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:55:28,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:55:28,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:55:28,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:55:28,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:55:28,596 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:55:28,598 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:55:29,079 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-01-09 09:55:29,080 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:55:29,095 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:55:29,095 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:55:29,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:55:29 BoogieIcfgContainer [2025-01-09 09:55:29,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:55:29,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:55:29,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:55:29,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:55:29,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:55:27" (1/3) ... [2025-01-09 09:55:29,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cd8e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:55:29, skipping insertion in model container [2025-01-09 09:55:29,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28" (2/3) ... [2025-01-09 09:55:29,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cd8e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:55:29, skipping insertion in model container [2025-01-09 09:55:29,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:55:29" (3/3) ... [2025-01-09 09:55:29,107 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-01-09 09:55:29,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:55:29,125 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:55:29,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:55:29,207 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;@59d76505, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:55:29,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:55:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 09:55:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 09:55:29,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:29,226 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:29,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:29,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1413466570, now seen corresponding path program 1 times [2025-01-09 09:55:29,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:55:29,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985939274] [2025-01-09 09:55:29,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:55:29,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 09:55:29,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 09:55:29,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:29,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 09:55:29,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:55:29,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985939274] [2025-01-09 09:55:29,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985939274] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:55:29,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225652917] [2025-01-09 09:55:29,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:29,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:55:29,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:55:29,608 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:55:29,610 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:55:29,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 09:55:29,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 09:55:29,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:29,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:29,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:55:29,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:55:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 09:55:29,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:55:29,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225652917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:55:29,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:55:29,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:55:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897666240] [2025-01-09 09:55:29,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:55:29,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:55:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:55:29,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:55:29,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:55:29,909 INFO L87 Difference]: Start difference. First operand has 110 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 09:55:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:29,944 INFO L93 Difference]: Finished difference Result 214 states and 362 transitions. [2025-01-09 09:55:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:55:29,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-01-09 09:55:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:29,952 INFO L225 Difference]: With dead ends: 214 [2025-01-09 09:55:29,952 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 09:55:29,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:55:29,961 INFO L435 NwaCegarLoop]: 163 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, 163 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:55:29,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:55:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 09:55:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 09:55:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 09:55:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 163 transitions. [2025-01-09 09:55:30,007 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 163 transitions. Word has length 202 [2025-01-09 09:55:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:30,007 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 163 transitions. [2025-01-09 09:55:30,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 09:55:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 163 transitions. [2025-01-09 09:55:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 09:55:30,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:30,014 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:30,022 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:55:30,215 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:55:30,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:30,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1569782580, now seen corresponding path program 1 times [2025-01-09 09:55:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:55:30,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659132529] [2025-01-09 09:55:30,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:55:30,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 09:55:30,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 09:55:30,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:30,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 09:55:30,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:55:30,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659132529] [2025-01-09 09:55:30,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659132529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:55:30,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:55:30,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:55:30,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465929942] [2025-01-09 09:55:30,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:55:30,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:55:30,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:55:30,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:55:30,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:55:30,474 INFO L87 Difference]: Start difference. First operand 107 states and 163 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:30,569 INFO L93 Difference]: Finished difference Result 306 states and 468 transitions. [2025-01-09 09:55:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:55:30,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-01-09 09:55:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:30,578 INFO L225 Difference]: With dead ends: 306 [2025-01-09 09:55:30,579 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 09:55:30,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:55:30,581 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 140 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:30,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 425 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:55:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 09:55:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2025-01-09 09:55:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 135 states have internal predecessors, (180), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 09:55:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 304 transitions. [2025-01-09 09:55:30,622 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 304 transitions. Word has length 202 [2025-01-09 09:55:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:30,623 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 304 transitions. [2025-01-09 09:55:30,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 304 transitions. [2025-01-09 09:55:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:55:30,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:30,626 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:30,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:55:30,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -11673955, now seen corresponding path program 1 times [2025-01-09 09:55:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:55:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577286293] [2025-01-09 09:55:30,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:55:30,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:55:30,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:55:30,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:30,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 09:55:31,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:55:31,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577286293] [2025-01-09 09:55:31,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577286293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:55:31,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:55:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:55:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349757502] [2025-01-09 09:55:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:55:31,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:55:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:55:31,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:55:31,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:55:31,078 INFO L87 Difference]: Start difference. First operand 200 states and 304 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:31,360 INFO L93 Difference]: Finished difference Result 647 states and 979 transitions. [2025-01-09 09:55:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:55:31,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-01-09 09:55:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:31,365 INFO L225 Difference]: With dead ends: 647 [2025-01-09 09:55:31,365 INFO L226 Difference]: Without dead ends: 450 [2025-01-09 09:55:31,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55:31,367 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 165 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:31,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 475 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:55:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-01-09 09:55:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 432. [2025-01-09 09:55:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 303 states have (on average 1.33993399339934) internal successors, (406), 303 states have internal predecessors, (406), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 09:55:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 654 transitions. [2025-01-09 09:55:31,444 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 654 transitions. Word has length 203 [2025-01-09 09:55:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:31,445 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 654 transitions. [2025-01-09 09:55:31,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 654 transitions. [2025-01-09 09:55:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 09:55:31,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:31,452 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:55:31,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:31,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:31,453 INFO L85 PathProgramCache]: Analyzing trace with hash -257335102, now seen corresponding path program 1 times [2025-01-09 09:55:31,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:55:31,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241753695] [2025-01-09 09:55:31,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:31,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:55:31,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 09:55:31,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 09:55:31,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:31,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 09:55:31,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:55:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241753695] [2025-01-09 09:55:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241753695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:55:31,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:55:31,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:55:31,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155885179] [2025-01-09 09:55:31,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:55:31,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:55:31,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:55:31,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:55:31,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:55:31,801 INFO L87 Difference]: Start difference. First operand 432 states and 654 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:31,891 INFO L93 Difference]: Finished difference Result 1087 states and 1652 transitions. [2025-01-09 09:55:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:55:31,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-01-09 09:55:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:31,901 INFO L225 Difference]: With dead ends: 1087 [2025-01-09 09:55:31,903 INFO L226 Difference]: Without dead ends: 658 [2025-01-09 09:55:31,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:55:31,906 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 89 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:31,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 327 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:55:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-09 09:55:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 656. [2025-01-09 09:55:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 463 states have (on average 1.3369330453563715) internal successors, (619), 463 states have internal predecessors, (619), 186 states have call successors, (186), 6 states have call predecessors, (186), 6 states have return successors, (186), 186 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 09:55:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 991 transitions. [2025-01-09 09:55:31,985 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 991 transitions. Word has length 204 [2025-01-09 09:55:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:31,987 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 991 transitions. [2025-01-09 09:55:31,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 991 transitions. [2025-01-09 09:55:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 09:55:31,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:31,991 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:55:31,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:31,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash 511708026, now seen corresponding path program 1 times [2025-01-09 09:55:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:55:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345629662] [2025-01-09 09:55:31,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:55:32,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 09:55:32,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 09:55:32,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:32,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 09:55:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:55:32,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345629662] [2025-01-09 09:55:32,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345629662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:55:32,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:55:32,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:55:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298288842] [2025-01-09 09:55:32,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:55:32,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:55:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:55:32,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:55:32,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:55:32,333 INFO L87 Difference]: Start difference. First operand 656 states and 991 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:32,506 INFO L93 Difference]: Finished difference Result 658 states and 992 transitions. [2025-01-09 09:55:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:55:32,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-01-09 09:55:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:32,510 INFO L225 Difference]: With dead ends: 658 [2025-01-09 09:55:32,510 INFO L226 Difference]: Without dead ends: 229 [2025-01-09 09:55:32,511 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:55:32,512 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 159 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:32,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 149 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:55:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-09 09:55:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-01-09 09:55:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 164 states have (on average 1.3109756097560976) internal successors, (215), 164 states have internal predecessors, (215), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 09:55:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 339 transitions. [2025-01-09 09:55:32,550 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 339 transitions. Word has length 205 [2025-01-09 09:55:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:32,551 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 339 transitions. [2025-01-09 09:55:32,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 339 transitions. [2025-01-09 09:55:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 09:55:32,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:32,556 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:32,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:55:32,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:32,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:32,557 INFO L85 PathProgramCache]: Analyzing trace with hash -321516579, now seen corresponding path program 1 times [2025-01-09 09:55:32,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:55:32,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726173730] [2025-01-09 09:55:32,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:32,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:55:32,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 09:55:32,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 09:55:32,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:32,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 09:55:32,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:55:32,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726173730] [2025-01-09 09:55:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726173730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:55:32,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:55:32,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:55:32,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184444635] [2025-01-09 09:55:32,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:55:32,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:55:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:55:32,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:55:32,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:55:32,709 INFO L87 Difference]: Start difference. First operand 229 states and 339 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:32,822 INFO L93 Difference]: Finished difference Result 673 states and 1000 transitions. [2025-01-09 09:55:32,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:55:32,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-01-09 09:55:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:32,827 INFO L225 Difference]: With dead ends: 673 [2025-01-09 09:55:32,827 INFO L226 Difference]: Without dead ends: 447 [2025-01-09 09:55:32,828 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:55:32,828 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 149 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:32,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 421 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:55:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-09 09:55:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 235. [2025-01-09 09:55:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 170 states have (on average 1.3) internal successors, (221), 170 states have internal predecessors, (221), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 09:55:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 345 transitions. [2025-01-09 09:55:32,885 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 345 transitions. Word has length 205 [2025-01-09 09:55:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:32,886 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 345 transitions. [2025-01-09 09:55:32,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 345 transitions. [2025-01-09 09:55:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 09:55:32,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:32,891 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:32,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:55:32,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:32,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:32,891 INFO L85 PathProgramCache]: Analyzing trace with hash 379547999, now seen corresponding path program 1 times [2025-01-09 09:55:32,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:55:32,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450230693] [2025-01-09 09:55:32,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:32,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:55:32,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 09:55:32,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 09:55:32,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:32,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 09:55:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:55:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450230693] [2025-01-09 09:55:33,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450230693] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:55:33,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914072909] [2025-01-09 09:55:33,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:33,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:55:33,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:55:33,352 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:55:33,354 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:55:33,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 09:55:33,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 09:55:33,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:33,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:33,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 09:55:33,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:55:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-01-09 09:55:34,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:55:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 09:55:34,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914072909] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:55:34,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:55:34,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 21 [2025-01-09 09:55:34,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117496277] [2025-01-09 09:55:34,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:55:34,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 09:55:34,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:55:34,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 09:55:34,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-01-09 09:55:34,802 INFO L87 Difference]: Start difference. First operand 235 states and 345 transitions. Second operand has 21 states, 21 states have (on average 6.904761904761905) internal successors, (145), 21 states have internal predecessors, (145), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2025-01-09 09:55:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:40,724 INFO L93 Difference]: Finished difference Result 1359 states and 1933 transitions. [2025-01-09 09:55:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-01-09 09:55:40,725 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.904761904761905) internal successors, (145), 21 states have internal predecessors, (145), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 205 [2025-01-09 09:55:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:40,733 INFO L225 Difference]: With dead ends: 1359 [2025-01-09 09:55:40,733 INFO L226 Difference]: Without dead ends: 1127 [2025-01-09 09:55:40,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 408 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4612 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2232, Invalid=10878, Unknown=0, NotChecked=0, Total=13110 [2025-01-09 09:55:40,751 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 1550 mSDsluCounter, 4199 mSDsCounter, 0 mSdLazyCounter, 3980 mSolverCounterSat, 921 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 4733 SdHoareTripleChecker+Invalid, 4901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 921 IncrementalHoareTripleChecker+Valid, 3980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:40,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 4733 Invalid, 4901 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [921 Valid, 3980 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 09:55:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-01-09 09:55:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 477. [2025-01-09 09:55:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 342 states have (on average 1.2748538011695907) internal successors, (436), 342 states have internal predecessors, (436), 124 states have call successors, (124), 10 states have call predecessors, (124), 10 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 09:55:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 684 transitions. [2025-01-09 09:55:40,875 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 684 transitions. Word has length 205 [2025-01-09 09:55:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:40,875 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 684 transitions. [2025-01-09 09:55:40,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.904761904761905) internal successors, (145), 21 states have internal predecessors, (145), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2025-01-09 09:55:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 684 transitions. [2025-01-09 09:55:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 09:55:40,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:40,878 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:40,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:55:41,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:55:41,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:41,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash -469573065, now seen corresponding path program 1 times [2025-01-09 09:55:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:55:41,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680274793] [2025-01-09 09:55:41,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:55:41,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 09:55:41,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 09:55:41,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:41,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 09:55:41,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:55:41,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680274793] [2025-01-09 09:55:41,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680274793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:55:41,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218565320] [2025-01-09 09:55:41,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:41,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:55:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:55:41,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:55:41,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:55:41,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 09:55:41,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 09:55:41,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:41,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:41,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 09:55:41,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:55:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 654 proven. 18 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2025-01-09 09:55:41,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:55:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 09:55:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218565320] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:55:42,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:55:42,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 09:55:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272155682] [2025-01-09 09:55:42,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:55:42,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:55:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:55:42,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:55:42,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:55:42,054 INFO L87 Difference]: Start difference. First operand 477 states and 684 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 3 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-01-09 09:55:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:42,793 INFO L93 Difference]: Finished difference Result 987 states and 1408 transitions. [2025-01-09 09:55:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:55:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 3 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 207 [2025-01-09 09:55:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:42,799 INFO L225 Difference]: With dead ends: 987 [2025-01-09 09:55:42,799 INFO L226 Difference]: Without dead ends: 753 [2025-01-09 09:55:42,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-01-09 09:55:42,803 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 395 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:42,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 771 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:55:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-01-09 09:55:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 732. [2025-01-09 09:55:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 517 states have (on average 1.263056092843327) internal successors, (653), 520 states have internal predecessors, (653), 196 states have call successors, (196), 18 states have call predecessors, (196), 18 states have return successors, (196), 193 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 09:55:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1045 transitions. [2025-01-09 09:55:42,887 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1045 transitions. Word has length 207 [2025-01-09 09:55:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:42,887 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1045 transitions. [2025-01-09 09:55:42,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 3 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-01-09 09:55:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1045 transitions. [2025-01-09 09:55:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 09:55:42,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:42,890 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:42,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 09:55:43,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:55:43,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:43,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 353234363, now seen corresponding path program 1 times [2025-01-09 09:55:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:55:43,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258671633] [2025-01-09 09:55:43,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:55:43,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 09:55:43,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 09:55:43,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:43,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:55:43,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23514318] [2025-01-09 09:55:43,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:43,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:55:43,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:55:43,205 INFO L229 MonitoredProcess]: Starting monitored process 5 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:55:43,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 09:55:43,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 09:55:43,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 09:55:43,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:43,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:55:43,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:55:43,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 09:55:43,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 09:55:43,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:43,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:55:44,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:55:44,063 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:55:44,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:55:44,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 09:55:44,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 09:55:44,269 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:55:44,422 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:55:44,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:55:44 BoogieIcfgContainer [2025-01-09 09:55:44,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:55:44,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:55:44,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:55:44,427 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:55:44,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:55:29" (3/4) ... [2025-01-09 09:55:44,430 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:55:44,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:55:44,433 INFO L158 Benchmark]: Toolchain (without parser) took 16458.09ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 106.0MB in the beginning and 210.6MB in the end (delta: -104.6MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2025-01-09 09:55:44,433 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:55:44,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.19ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 90.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:55:44,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.65ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 86.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:55:44,433 INFO L158 Benchmark]: Boogie Preprocessor took 66.22ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 82.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:55:44,434 INFO L158 Benchmark]: RCFGBuilder took 658.32ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 53.8MB in the end (delta: 29.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:55:44,434 INFO L158 Benchmark]: TraceAbstraction took 15328.23ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 52.8MB in the beginning and 210.7MB in the end (delta: -157.9MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2025-01-09 09:55:44,434 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 327.2MB. Free memory was 210.7MB in the beginning and 210.6MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:55:44,435 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.40ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.19ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 90.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.65ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 86.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.22ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 82.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 658.32ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 53.8MB in the end (delta: 29.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15328.23ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 52.8MB in the beginning and 210.7MB in the end (delta: -157.9MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 327.2MB. Free memory was 210.7MB in the beginning and 210.6MB in the end (delta: 101.6kB). 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 shiftLeft at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryArithmeticFLOAToperation at line 93, overapproximation of someUnaryFLOAToperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] signed short int var_1_25 = 5; [L41] unsigned short int var_1_26 = 500; [L42] unsigned char var_1_27 = 1; [L43] signed short int var_1_28 = -32; [L44] unsigned short int var_1_29 = 54921; [L45] unsigned char var_1_30 = 1; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 0; [L48] double var_1_33 = 10000000000000.8; [L49] float var_1_34 = 0.125; [L50] float var_1_35 = 8.5; [L51] float var_1_36 = 7.5; [L52] float var_1_37 = 3.2; [L53] unsigned char last_1_var_1_1 = 0; [L54] unsigned long int last_1_var_1_9 = 10; [L55] signed short int last_1_var_1_14 = 32; [L56] unsigned char last_1_var_1_16 = 1; [L57] signed char last_1_var_1_20 = 1; VAL [isInitial=0, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=0, var_1_9=10] [L183] isInitial = 1 [L184] FCALL initially() [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_9 = var_1_9 [L174] last_1_var_1_14 = var_1_14 [L175] last_1_var_1_16 = var_1_16 [L176] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=0, var_1_9=10] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L122] var_1_8 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L124] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L124] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L125] var_1_11 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L126] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L127] var_1_12 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L128] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L129] var_1_13 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L130] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L131] var_1_15 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L132] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L133] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L133] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L134] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L134] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L135] var_1_17 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L136] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L137] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L137] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L138] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L138] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L139] var_1_18 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L140] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L141] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L141] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L142] var_1_19 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L143] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L144] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L145] var_1_21 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L146] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L147] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L147] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L148] var_1_25 = __VERIFIER_nondet_short() [L149] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L149] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L150] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L150] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L151] var_1_27 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L153] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L153] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L154] var_1_28 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L155] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L156] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L156] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L157] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L157] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L158] var_1_29 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L159] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L160] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L160] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L161] var_1_31 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L162] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L163] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L163] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L164] var_1_35 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 4611686.018427382800e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L165] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 4611686.018427382800e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L166] var_1_36 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L167] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L168] var_1_37 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_37 >= -461168.6018427382800e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L169] RET assume_abort_if_not((var_1_37 >= -461168.6018427382800e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L187] RET updateVariables() [L188] CALL step() [L61] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L62] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L67] COND TRUE ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29))) >= ((((-16) > (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))) ? (-16) : (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))) [L68] var_1_30 = (! var_1_31) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L70] var_1_32 = 1 [L71] var_1_33 = 5.25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR var_1_26 >> var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR ((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR var_1_26 >> var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR ((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] COND FALSE !(((((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)))) <= var_1_28) [L77] var_1_34 = var_1_35 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L79] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L80] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L81] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L86] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L87] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L87] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L88] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L90] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L91] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L92] COND TRUE (! var_1_1) || stepLocal_4 [L93] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L101] var_1_20 = var_1_21 [L102] var_1_22 = var_1_12 [L103] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L104] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L107] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L107] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L108] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=9, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L113] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L114] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=9, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L115] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=9, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L116] COND TRUE stepLocal_2 <= (-5 + var_1_16) [L117] var_1_9 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=9, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=9] [L188] RET step() [L189] CALL, EXPR property() [L179] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=9, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=9] [L179] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=9, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=9] [L179-L180] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=9, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=9] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=9, var_1_15=10, var_1_16=9, var_1_17=11, var_1_18=-1015, var_1_19=-248, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 9, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2721 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2647 mSDsluCounter, 7464 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5480 mSDsCounter, 1183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4711 IncrementalHoareTripleChecker+Invalid, 5894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1183 mSolverCounterUnsat, 1984 mSDtfsCounter, 4711 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1181 GetRequests, 1034 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4706 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=732occurred in iteration=8, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 905 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2663 NumberOfCodeBlocks, 2663 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2646 ConstructedInterpolants, 0 QuantifiedInterpolants, 5600 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1456 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 23958/24180 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:55:44,470 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-25_file-53.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 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:55:46,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:55:46,827 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:55:46,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:55:46,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:55:46,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:55:46,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:55:46,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:55:46,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:55:46,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:55:46,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:55:46,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:55:46,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:55:46,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:55:46,871 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:55:46,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:55:46,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:55:46,872 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:55:46,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:55:46,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:55:46,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:55:46,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:55:46,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:55:46,872 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:55:46,872 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:55:46,872 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:55:46,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:55:46,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:55:46,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:55:46,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:55:46,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:55:46,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:55:46,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:55:46,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:55:46,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:55:46,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:55:46,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:55:46,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:55:46,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:55:46,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:55:46,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:55:46,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:55:46,875 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:55:46,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:55:46,875 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:55:46,875 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:55:46,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:55:46,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:55:46,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:55:46,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:55:46,876 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 -> 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd [2025-01-09 09:55:47,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:55:47,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:55:47,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:55:47,179 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:55:47,179 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:55:47,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-01-09 09:55:48,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98f938f10/bd73453c6034470a9c16d3a8e3697bb7/FLAGe734b7fd1 [2025-01-09 09:55:48,707 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:55:48,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-01-09 09:55:48,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98f938f10/bd73453c6034470a9c16d3a8e3697bb7/FLAGe734b7fd1 [2025-01-09 09:55:49,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98f938f10/bd73453c6034470a9c16d3a8e3697bb7 [2025-01-09 09:55:49,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:55:49,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:55:49,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:55:49,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:55:49,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:55:49,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f7fcdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49, skipping insertion in model container [2025-01-09 09:55:49,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:55:49,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i[915,928] [2025-01-09 09:55:49,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:55:49,236 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:55:49,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i[915,928] [2025-01-09 09:55:49,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:55:49,287 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:55:49,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49 WrapperNode [2025-01-09 09:55:49,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:55:49,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:55:49,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:55:49,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:55:49,295 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:55:49" (1/1) ... [2025-01-09 09:55:49,313 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:55:49" (1/1) ... [2025-01-09 09:55:49,350 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-01-09 09:55:49,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:55:49,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:55:49,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:55:49,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:55:49,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,393 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:55:49,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:55:49,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:55:49,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:55:49,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:55:49,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (1/1) ... [2025-01-09 09:55:49,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:55:49,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:55:49,471 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:55:49,476 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:55:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:55:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:55:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:55:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:55:49,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:55:49,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:55:49,573 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:55:49,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:55:50,391 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 09:55:50,392 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:55:50,402 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:55:50,403 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:55:50,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:55:50 BoogieIcfgContainer [2025-01-09 09:55:50,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:55:50,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:55:50,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:55:50,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:55:50,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:55:49" (1/3) ... [2025-01-09 09:55:50,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2ed33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:55:50, skipping insertion in model container [2025-01-09 09:55:50,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:49" (2/3) ... [2025-01-09 09:55:50,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2ed33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:55:50, skipping insertion in model container [2025-01-09 09:55:50,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:55:50" (3/3) ... [2025-01-09 09:55:50,412 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-01-09 09:55:50,423 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:55:50,425 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:55:50,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:55:50,480 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;@460302ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:55:50,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:55:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 09:55:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 09:55:50,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:50,495 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:50,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:50,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:50,500 INFO L85 PathProgramCache]: Analyzing trace with hash -331248863, now seen corresponding path program 1 times [2025-01-09 09:55:50,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:55:50,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876901786] [2025-01-09 09:55:50,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:50,510 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:55:50,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:55:50,513 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:55:50,514 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:55:50,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 09:55:50,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 09:55:50,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:50,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:50,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:55:50,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:55:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2025-01-09 09:55:50,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:55:50,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:55:50,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876901786] [2025-01-09 09:55:50,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876901786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:55:50,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:55:50,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:55:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705864650] [2025-01-09 09:55:50,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:55:50,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:55:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:55:50,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:55:50,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:55:50,949 INFO L87 Difference]: Start difference. First operand has 86 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 09:55:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:50,974 INFO L93 Difference]: Finished difference Result 166 states and 290 transitions. [2025-01-09 09:55:50,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:55:50,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 195 [2025-01-09 09:55:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:50,980 INFO L225 Difference]: With dead ends: 166 [2025-01-09 09:55:50,980 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 09:55:50,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 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:55:50,985 INFO L435 NwaCegarLoop]: 127 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, 127 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:55:50,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:55:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 09:55:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 09:55:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 09:55:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2025-01-09 09:55:51,033 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 195 [2025-01-09 09:55:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:51,034 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2025-01-09 09:55:51,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 09:55:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2025-01-09 09:55:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 09:55:51,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:51,039 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:51,052 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:55:51,240 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:55:51,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:51,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1373026333, now seen corresponding path program 1 times [2025-01-09 09:55:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:55:51,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787261259] [2025-01-09 09:55:51,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:51,242 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:55:51,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:55:51,245 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:55:51,246 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:55:51,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 09:55:51,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 09:55:51,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:51,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:51,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:55:51,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:55:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 09:55:52,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:55:52,068 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:55:52,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787261259] [2025-01-09 09:55:52,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787261259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:55:52,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:55:52,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:55:52,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526418676] [2025-01-09 09:55:52,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:55:52,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:55:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:55:52,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:55:52,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:55:52,071 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:52,447 INFO L93 Difference]: Finished difference Result 241 states and 371 transitions. [2025-01-09 09:55:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:55:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2025-01-09 09:55:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:52,455 INFO L225 Difference]: With dead ends: 241 [2025-01-09 09:55:52,456 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 09:55:52,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 193 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:55:52,459 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 24 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:52,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 234 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:55:52,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 09:55:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2025-01-09 09:55:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 94 states have internal predecessors, (120), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 09:55:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 244 transitions. [2025-01-09 09:55:52,504 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 244 transitions. Word has length 195 [2025-01-09 09:55:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:52,505 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 244 transitions. [2025-01-09 09:55:52,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2025-01-09 09:55:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 09:55:52,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:52,508 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 09:55:52,709 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:55:52,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:52,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:52,710 INFO L85 PathProgramCache]: Analyzing trace with hash 4632508, now seen corresponding path program 1 times [2025-01-09 09:55:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:55:52,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614713728] [2025-01-09 09:55:52,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:52,711 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:55:52,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:55:52,713 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:55:52,714 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:55:52,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 09:55:52,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 09:55:52,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:52,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:52,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:55:52,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:55:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 09:55:53,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:55:53,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:55:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614713728] [2025-01-09 09:55:53,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614713728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:55:53,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:55:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:55:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65744765] [2025-01-09 09:55:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:55:53,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:55:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:55:53,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:55:53,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:55:53,016 INFO L87 Difference]: Start difference. First operand 159 states and 244 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:53,405 INFO L93 Difference]: Finished difference Result 401 states and 616 transitions. [2025-01-09 09:55:53,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:55:53,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-01-09 09:55:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:53,409 INFO L225 Difference]: With dead ends: 401 [2025-01-09 09:55:53,409 INFO L226 Difference]: Without dead ends: 245 [2025-01-09 09:55:53,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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:55:53,411 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 118 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:53,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 352 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:55:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-09 09:55:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 161. [2025-01-09 09:55:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 96 states have internal predecessors, (122), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 09:55:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 246 transitions. [2025-01-09 09:55:53,442 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 246 transitions. Word has length 196 [2025-01-09 09:55:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:53,443 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 246 transitions. [2025-01-09 09:55:53,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 246 transitions. [2025-01-09 09:55:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 09:55:53,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:53,446 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:53,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 09:55:53,646 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:55:53,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:53,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1779639870, now seen corresponding path program 1 times [2025-01-09 09:55:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:55:53,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95242996] [2025-01-09 09:55:53,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:53,648 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:55:53,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:55:53,650 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:55:53,651 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:55:53,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 09:55:53,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 09:55:53,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:53,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:53,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 09:55:53,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:55:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-01-09 09:55:54,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:55:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 09:55:54,580 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:55:54,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95242996] [2025-01-09 09:55:54,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95242996] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:55:54,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:55:54,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-01-09 09:55:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617472437] [2025-01-09 09:55:54,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:55:54,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:55:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:55:54,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:55:54,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:55:54,582 INFO L87 Difference]: Start difference. First operand 161 states and 246 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 09:55:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:56,815 INFO L93 Difference]: Finished difference Result 501 states and 752 transitions. [2025-01-09 09:55:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 09:55:56,817 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 196 [2025-01-09 09:55:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:56,824 INFO L225 Difference]: With dead ends: 501 [2025-01-09 09:55:56,825 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 09:55:56,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2025-01-09 09:55:56,827 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 369 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:56,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 654 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 09:55:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 09:55:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 167. [2025-01-09 09:55:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 100 states have (on average 1.25) internal successors, (125), 100 states have internal predecessors, (125), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 09:55:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 249 transitions. [2025-01-09 09:55:56,873 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 249 transitions. Word has length 196 [2025-01-09 09:55:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:56,875 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 249 transitions. [2025-01-09 09:55:56,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 09:55:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 249 transitions. [2025-01-09 09:55:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 09:55:56,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:56,879 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:56,892 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 (5)] Forceful destruction successful, exit code 0 [2025-01-09 09:55:57,079 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:55:57,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:57,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash -571328746, now seen corresponding path program 1 times [2025-01-09 09:55:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:55:57,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253703012] [2025-01-09 09:55:57,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:57,082 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:55:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:55:57,084 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:55:57,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 (6)] Waiting until timeout for monitored process [2025-01-09 09:55:57,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 09:55:57,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 09:55:57,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:57,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:57,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:55:57,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:55:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 09:55:58,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:55:58,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:55:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253703012] [2025-01-09 09:55:58,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253703012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:55:58,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:55:58,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:55:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535146175] [2025-01-09 09:55:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:55:58,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:55:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:55:58,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:55:58,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:55:58,304 INFO L87 Difference]: Start difference. First operand 167 states and 249 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:55:59,038 INFO L93 Difference]: Finished difference Result 414 states and 616 transitions. [2025-01-09 09:55:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:55:59,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-01-09 09:55:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:55:59,055 INFO L225 Difference]: With dead ends: 414 [2025-01-09 09:55:59,056 INFO L226 Difference]: Without dead ends: 250 [2025-01-09 09:55:59,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:55:59,057 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 70 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:55:59,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 415 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:55:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-09 09:55:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 233. [2025-01-09 09:55:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 133 states have (on average 1.2255639097744362) internal successors, (163), 133 states have internal predecessors, (163), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 09:55:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 349 transitions. [2025-01-09 09:55:59,111 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 349 transitions. Word has length 196 [2025-01-09 09:55:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:55:59,114 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 349 transitions. [2025-01-09 09:55:59,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 09:55:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 349 transitions. [2025-01-09 09:55:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 09:55:59,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:55:59,117 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:59,128 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 (6)] Ended with exit code 0 [2025-01-09 09:55:59,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:55:59,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:55:59,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:55:59,319 INFO L85 PathProgramCache]: Analyzing trace with hash -91952479, now seen corresponding path program 1 times [2025-01-09 09:55:59,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:55:59,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910589465] [2025-01-09 09:55:59,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:55:59,319 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:55:59,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:55:59,321 INFO L229 MonitoredProcess]: Starting monitored process 7 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:55:59,322 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 (7)] Waiting until timeout for monitored process [2025-01-09 09:55:59,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 09:55:59,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 09:55:59,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:55:59,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:55:59,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 09:55:59,620 INFO L279 TraceCheckSpWp]: Computing forward predicates...