./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.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_fillercodestructure_filler-ps-co_file-37.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 67842bd2132ccd8a41236e85d94558bf263880db0378e3df7d9b2f0e5d6e4ad1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:04:45,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:04:45,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:04:45,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:04:45,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:04:45,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:04:45,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:04:45,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:04:45,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:04:45,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:04:45,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:04:45,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:04:45,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:04:45,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:04:45,957 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:04:45,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:04:45,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:04:45,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:04:45,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:04:45,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:04:45,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:04:45,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:04:45,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:04:45,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:04:45,958 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:04:45,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:04:45,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:04:45,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:04:45,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:04:45,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:04:45,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:04:45,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:04:45,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:04:45,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:04:45,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:04:45,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:04:45,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:04:45,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:04:45,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:04:45,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:04:45,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:04:45,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:04:45,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:04:45,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:04:45,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:04:45,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:04:45,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:04:45,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:04:45,961 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 -> 67842bd2132ccd8a41236e85d94558bf263880db0378e3df7d9b2f0e5d6e4ad1 [2025-01-09 12:04:46,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:04:46,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:04:46,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:04:46,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:04:46,175 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:04:46,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2025-01-09 12:04:47,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ab1218a7/ee513536b4194e09842ea8d86c8b118c/FLAG7a05cbdce [2025-01-09 12:04:47,741 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:04:47,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2025-01-09 12:04:47,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ab1218a7/ee513536b4194e09842ea8d86c8b118c/FLAG7a05cbdce [2025-01-09 12:04:47,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ab1218a7/ee513536b4194e09842ea8d86c8b118c [2025-01-09 12:04:47,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:04:47,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:04:47,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:04:47,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:04:47,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:04:47,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:04:47" (1/1) ... [2025-01-09 12:04:47,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2078f7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:47, skipping insertion in model container [2025-01-09 12:04:47,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:04:47" (1/1) ... [2025-01-09 12:04:47,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:04:47,917 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_fillercodestructure_filler-ps-co_file-37.i[919,932] [2025-01-09 12:04:47,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:04:47,979 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:04:47,988 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_fillercodestructure_filler-ps-co_file-37.i[919,932] [2025-01-09 12:04:48,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:04:48,024 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:04:48,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48 WrapperNode [2025-01-09 12:04:48,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:04:48,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:04:48,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:04:48,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:04:48,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,065 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2025-01-09 12:04:48,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:04:48,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:04:48,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:04:48,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:04:48,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,088 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 12:04:48,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:04:48,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:04:48,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:04:48,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:04:48,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (1/1) ... [2025-01-09 12:04:48,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:04:48,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:04:48,167 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 12:04:48,170 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 12:04:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:04:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:04:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:04:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:04:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:04:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:04:48,256 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:04:48,257 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:04:48,526 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 12:04:48,526 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:04:48,534 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:04:48,534 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:04:48,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:04:48 BoogieIcfgContainer [2025-01-09 12:04:48,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:04:48,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:04:48,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:04:48,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:04:48,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:04:47" (1/3) ... [2025-01-09 12:04:48,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62afef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:04:48, skipping insertion in model container [2025-01-09 12:04:48,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:48" (2/3) ... [2025-01-09 12:04:48,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62afef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:04:48, skipping insertion in model container [2025-01-09 12:04:48,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:04:48" (3/3) ... [2025-01-09 12:04:48,543 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2025-01-09 12:04:48,553 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:04:48,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:04:48,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:04:48,598 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;@5d5404ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:04:48,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:04:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 71 states have internal predecessors, (104), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 12:04:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 12:04:48,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:48,610 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:48,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:48,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1286719000, now seen corresponding path program 1 times [2025-01-09 12:04:48,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225309620] [2025-01-09 12:04:48,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:48,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:04:48,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:04:48,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:48,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 12:04:48,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:48,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225309620] [2025-01-09 12:04:48,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225309620] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:04:48,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052609662] [2025-01-09 12:04:48,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:48,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:04:48,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:04:48,928 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 12:04:48,930 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 12:04:49,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:04:49,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:04:49,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:49,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:49,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:04:49,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:04:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 12:04:49,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:04:49,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052609662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:49,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:04:49,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:04:49,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457369601] [2025-01-09 12:04:49,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:49,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:04:49,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:49,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:04:49,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:04:49,156 INFO L87 Difference]: Start difference. First operand has 105 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 71 states have internal predecessors, (104), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 12:04:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:49,181 INFO L93 Difference]: Finished difference Result 204 states and 363 transitions. [2025-01-09 12:04:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:04:49,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 208 [2025-01-09 12:04:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:49,189 INFO L225 Difference]: With dead ends: 204 [2025-01-09 12:04:49,189 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 12:04:49,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 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 12:04:49,195 INFO L435 NwaCegarLoop]: 160 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, 160 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 12:04:49,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:04:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 12:04:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 12:04:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 12:04:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 160 transitions. [2025-01-09 12:04:49,230 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 160 transitions. Word has length 208 [2025-01-09 12:04:49,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:49,230 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 160 transitions. [2025-01-09 12:04:49,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 12:04:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 160 transitions. [2025-01-09 12:04:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 12:04:49,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:49,233 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:49,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:04:49,434 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 12:04:49,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:49,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash 737448360, now seen corresponding path program 1 times [2025-01-09 12:04:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888537518] [2025-01-09 12:04:49,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:49,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:04:49,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:04:49,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:49,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 12:04:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888537518] [2025-01-09 12:04:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888537518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:49,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:04:49,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347436871] [2025-01-09 12:04:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:49,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:04:49,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:49,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:04:49,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:49,980 INFO L87 Difference]: Start difference. First operand 102 states and 160 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:50,270 INFO L93 Difference]: Finished difference Result 319 states and 511 transitions. [2025-01-09 12:04:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:04:50,270 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2025-01-09 12:04:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:50,273 INFO L225 Difference]: With dead ends: 319 [2025-01-09 12:04:50,273 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 12:04:50,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:04:50,274 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 153 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:50,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 319 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:04:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 12:04:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 195. [2025-01-09 12:04:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 128 states have (on average 1.390625) internal successors, (178), 128 states have internal predecessors, (178), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 12:04:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 306 transitions. [2025-01-09 12:04:50,297 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 306 transitions. Word has length 208 [2025-01-09 12:04:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:50,298 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 306 transitions. [2025-01-09 12:04:50,298 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 306 transitions. [2025-01-09 12:04:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 12:04:50,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:50,301 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:50,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:04:50,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:50,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1555028193, now seen corresponding path program 1 times [2025-01-09 12:04:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:50,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044502100] [2025-01-09 12:04:50,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:50,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 12:04:50,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 12:04:50,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:50,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 12:04:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044502100] [2025-01-09 12:04:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044502100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:50,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:50,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:04:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838987492] [2025-01-09 12:04:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:50,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:04:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:50,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:04:50,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:50,509 INFO L87 Difference]: Start difference. First operand 195 states and 306 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:50,720 INFO L93 Difference]: Finished difference Result 453 states and 718 transitions. [2025-01-09 12:04:50,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:04:50,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2025-01-09 12:04:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:50,727 INFO L225 Difference]: With dead ends: 453 [2025-01-09 12:04:50,727 INFO L226 Difference]: Without dead ends: 354 [2025-01-09 12:04:50,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:50,729 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 134 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:50,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 338 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:04:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-09 12:04:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 274. [2025-01-09 12:04:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 174 states have (on average 1.3735632183908046) internal successors, (239), 174 states have internal predecessors, (239), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 12:04:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 431 transitions. [2025-01-09 12:04:50,788 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 431 transitions. Word has length 209 [2025-01-09 12:04:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:50,788 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 431 transitions. [2025-01-09 12:04:50,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 431 transitions. [2025-01-09 12:04:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 12:04:50,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:50,794 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:50,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:04:50,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:50,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1421014687, now seen corresponding path program 1 times [2025-01-09 12:04:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216445551] [2025-01-09 12:04:50,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:50,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 12:04:50,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 12:04:50,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:50,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 12:04:51,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216445551] [2025-01-09 12:04:51,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216445551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:51,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:51,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:04:51,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151739949] [2025-01-09 12:04:51,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:51,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:04:51,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:51,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:04:51,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:04:51,009 INFO L87 Difference]: Start difference. First operand 274 states and 431 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:51,106 INFO L93 Difference]: Finished difference Result 529 states and 837 transitions. [2025-01-09 12:04:51,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:51,107 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2025-01-09 12:04:51,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:51,112 INFO L225 Difference]: With dead ends: 529 [2025-01-09 12:04:51,113 INFO L226 Difference]: Without dead ends: 317 [2025-01-09 12:04:51,113 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 12:04:51,114 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 73 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:51,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 260 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:04:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-01-09 12:04:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 285. [2025-01-09 12:04:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 185 states have (on average 1.3675675675675676) internal successors, (253), 185 states have internal predecessors, (253), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 12:04:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 445 transitions. [2025-01-09 12:04:51,163 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 445 transitions. Word has length 209 [2025-01-09 12:04:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:51,165 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 445 transitions. [2025-01-09 12:04:51,165 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 445 transitions. [2025-01-09 12:04:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 12:04:51,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:51,168 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:51,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:04:51,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:51,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1498942108, now seen corresponding path program 1 times [2025-01-09 12:04:51,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:51,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646778112] [2025-01-09 12:04:51,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:51,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:51,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 12:04:51,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 12:04:51,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:51,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 12:04:51,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:51,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646778112] [2025-01-09 12:04:51,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646778112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:51,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:51,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:04:51,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115959446] [2025-01-09 12:04:51,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:51,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:04:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:51,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:04:51,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:04:51,442 INFO L87 Difference]: Start difference. First operand 285 states and 445 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:51,544 INFO L93 Difference]: Finished difference Result 530 states and 834 transitions. [2025-01-09 12:04:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:51,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2025-01-09 12:04:51,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:51,548 INFO L225 Difference]: With dead ends: 530 [2025-01-09 12:04:51,549 INFO L226 Difference]: Without dead ends: 318 [2025-01-09 12:04:51,549 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 12:04:51,550 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 68 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:51,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 259 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:04:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-01-09 12:04:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 279. [2025-01-09 12:04:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 179 states have (on average 1.3687150837988826) internal successors, (245), 179 states have internal predecessors, (245), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 12:04:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 437 transitions. [2025-01-09 12:04:51,585 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 437 transitions. Word has length 211 [2025-01-09 12:04:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:51,586 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 437 transitions. [2025-01-09 12:04:51,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 437 transitions. [2025-01-09 12:04:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 12:04:51,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:51,589 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:51,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:04:51,589 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:51,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash 117931778, now seen corresponding path program 1 times [2025-01-09 12:04:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:51,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880485164] [2025-01-09 12:04:51,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:51,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:04:51,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:04:51,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:51,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 12:04:51,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:51,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880485164] [2025-01-09 12:04:51,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880485164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:51,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:51,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:04:51,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421448855] [2025-01-09 12:04:51,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:51,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:04:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:51,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:04:51,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:04:51,896 INFO L87 Difference]: Start difference. First operand 279 states and 437 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:52,168 INFO L93 Difference]: Finished difference Result 540 states and 849 transitions. [2025-01-09 12:04:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:04:52,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-01-09 12:04:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:52,171 INFO L225 Difference]: With dead ends: 540 [2025-01-09 12:04:52,171 INFO L226 Difference]: Without dead ends: 328 [2025-01-09 12:04:52,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:04:52,172 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 106 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:52,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 361 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:04:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-01-09 12:04:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 299. [2025-01-09 12:04:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 199 states have (on average 1.3718592964824121) internal successors, (273), 199 states have internal predecessors, (273), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 12:04:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 465 transitions. [2025-01-09 12:04:52,197 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 465 transitions. Word has length 212 [2025-01-09 12:04:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:52,198 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 465 transitions. [2025-01-09 12:04:52,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 465 transitions. [2025-01-09 12:04:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 12:04:52,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:52,199 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:52,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:04:52,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:52,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:52,200 INFO L85 PathProgramCache]: Analyzing trace with hash -456057342, now seen corresponding path program 1 times [2025-01-09 12:04:52,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:52,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834653061] [2025-01-09 12:04:52,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:52,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:52,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:04:52,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:04:52,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:52,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 12:04:52,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:52,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834653061] [2025-01-09 12:04:52,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834653061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:52,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:52,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:04:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394273425] [2025-01-09 12:04:52,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:52,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:04:52,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:52,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:04:52,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:04:52,404 INFO L87 Difference]: Start difference. First operand 299 states and 465 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:52,462 INFO L93 Difference]: Finished difference Result 533 states and 836 transitions. [2025-01-09 12:04:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:52,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-01-09 12:04:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:52,465 INFO L225 Difference]: With dead ends: 533 [2025-01-09 12:04:52,465 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 12:04:52,466 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 12:04:52,467 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 79 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:52,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 284 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:04:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 12:04:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 279. [2025-01-09 12:04:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 179 states have (on average 1.3631284916201116) internal successors, (244), 179 states have internal predecessors, (244), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 12:04:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 436 transitions. [2025-01-09 12:04:52,499 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 436 transitions. Word has length 212 [2025-01-09 12:04:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:52,499 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 436 transitions. [2025-01-09 12:04:52,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 436 transitions. [2025-01-09 12:04:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 12:04:52,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:52,503 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:52,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:04:52,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:52,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:52,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1307214267, now seen corresponding path program 1 times [2025-01-09 12:04:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:52,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653850424] [2025-01-09 12:04:52,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:52,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:52,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:04:52,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:04:52,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:52,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 12:04:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:52,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653850424] [2025-01-09 12:04:52,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653850424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:52,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:52,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:04:52,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225766057] [2025-01-09 12:04:52,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:52,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:04:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:52,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:04:52,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:52,962 INFO L87 Difference]: Start difference. First operand 279 states and 436 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:53,139 INFO L93 Difference]: Finished difference Result 518 states and 813 transitions. [2025-01-09 12:04:53,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:53,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2025-01-09 12:04:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:53,142 INFO L225 Difference]: With dead ends: 518 [2025-01-09 12:04:53,142 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 12:04:53,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:53,143 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 174 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:53,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 254 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:04:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 12:04:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 279. [2025-01-09 12:04:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 179 states have (on average 1.3575418994413408) internal successors, (243), 179 states have internal predecessors, (243), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 12:04:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 435 transitions. [2025-01-09 12:04:53,193 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 435 transitions. Word has length 213 [2025-01-09 12:04:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:53,194 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 435 transitions. [2025-01-09 12:04:53,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:04:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 435 transitions. [2025-01-09 12:04:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 12:04:53,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:53,195 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:53,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:04:53,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:53,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 797741177, now seen corresponding path program 1 times [2025-01-09 12:04:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285722258] [2025-01-09 12:04:53,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:53,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:04:53,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:04:53,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:53,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:04:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083864877] [2025-01-09 12:04:53,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:53,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:04:53,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:04:53,261 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 12:04:53,263 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 12:04:53,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:04:53,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:04:53,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:53,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:04:53,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:04:53,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:04:53,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:04:53,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:53,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:04:53,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:04:53,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:04:53,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:04:53,547 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 12:04:53,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:04:53,743 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:04:53,841 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:04:53,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:04:53 BoogieIcfgContainer [2025-01-09 12:04:53,843 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:04:53,844 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:04:53,844 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:04:53,844 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:04:53,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:04:48" (3/4) ... [2025-01-09 12:04:53,846 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:04:53,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:04:53,847 INFO L158 Benchmark]: Toolchain (without parser) took 6072.86ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 111.9MB in the beginning and 205.8MB in the end (delta: -93.9MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2025-01-09 12:04:53,847 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:04:53,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.47ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 95.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:04:53,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.85ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 91.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:04:53,847 INFO L158 Benchmark]: Boogie Preprocessor took 54.32ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 86.5MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:04:53,848 INFO L158 Benchmark]: RCFGBuilder took 409.13ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 57.4MB in the end (delta: 29.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 12:04:53,848 INFO L158 Benchmark]: TraceAbstraction took 5307.14ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 56.9MB in the beginning and 205.9MB in the end (delta: -149.0MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2025-01-09 12:04:53,848 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 335.5MB. Free memory was 205.9MB in the beginning and 205.8MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:04:53,849 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.47ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 95.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.85ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 91.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.32ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 86.5MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 409.13ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 57.4MB in the end (delta: 29.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5307.14ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 56.9MB in the beginning and 205.9MB in the end (delta: -149.0MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 335.5MB. Free memory was 205.9MB in the beginning and 205.8MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 194, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of bitwiseAnd at line 80, overapproximation of bitwiseAnd at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 194, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 256; [L23] unsigned short int var_1_2 = 51640; [L24] unsigned short int var_1_3 = 5; [L25] float var_1_7 = 128.8; [L26] unsigned char var_1_8 = 2; [L27] float var_1_9 = 256.5; [L28] float var_1_10 = 7.25; [L29] signed char var_1_11 = 64; [L30] signed char var_1_12 = -16; [L31] double var_1_13 = 0.9; [L32] unsigned char var_1_14 = 1; [L33] double var_1_15 = 0.0; [L34] double var_1_16 = 1.275; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 35331; [L37] signed char var_1_19 = -128; [L38] double var_1_20 = 0.0; [L39] double var_1_21 = 0.0; [L40] signed char var_1_22 = -8; [L41] signed char var_1_23 = 50; [L42] signed char var_1_26 = 5; [L43] signed long int var_1_27 = 32; [L44] unsigned char var_1_28 = 64; [L45] signed char var_1_29 = 100; [L46] signed char var_1_30 = -1; [L47] signed char var_1_31 = 10; [L48] signed char var_1_32 = 5; [L49] signed char var_1_33 = 1; [L50] unsigned short int var_1_34 = 32; [L51] unsigned char var_1_35 = 1; [L52] signed long int var_1_36 = -8; [L53] unsigned char var_1_37 = 1; [L54] float last_1_var_1_10 = 7.25; [L55] double last_1_var_1_13 = 0.9; [L56] unsigned short int last_1_var_1_17 = 8; [L57] signed char last_1_var_1_19 = -128; VAL [isInitial=0, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L198] isInitial = 1 [L199] FCALL initially() [L201] CALL updateLastVariables() [L188] last_1_var_1_10 = var_1_10 [L189] last_1_var_1_13 = var_1_13 [L190] last_1_var_1_17 = var_1_17 [L191] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L201] RET updateLastVariables() [L202] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L137] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L139] var_1_3 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L140] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L141] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L141] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L142] var_1_8 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L143] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L144] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L144] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_9=513/2] [L145] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L145] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L146] var_1_9 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L147] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L148] var_1_12 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L149] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L150] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L150] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L151] var_1_14 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L152] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L153] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L153] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L154] var_1_15 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L155] RET assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L156] var_1_16 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L157] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L158] var_1_18 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_18 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L159] RET assume_abort_if_not(var_1_18 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L160] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L160] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L161] var_1_20 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L162] RET assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L163] var_1_21 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L164] RET assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L165] var_1_22 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L166] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L167] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L167] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L168] var_1_26 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L169] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L170] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L170] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L171] var_1_30 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L172] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L173] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L173] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L174] var_1_31 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L176] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L176] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L177] var_1_33 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L178] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L179] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L179] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L180] var_1_35 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L181] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L182] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L182] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L183] var_1_37 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L184] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L185] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L185] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L202] RET updateVariables() [L203] CALL step() [L61] COND TRUE (~ (- var_1_17)) < var_1_1 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L62] COND FALSE !(var_1_1 < -64) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L66] COND FALSE !(var_1_17 > var_1_11) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L69] COND TRUE var_1_17 <= (((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) < 0 ) ? -((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) : ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) [L70] var_1_28 = 4 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=100, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L72] COND TRUE var_1_26 <= 16 [L73] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_31) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L75] COND TRUE var_1_11 >= var_1_11 [L76] var_1_32 = ((((4) < (((((var_1_26) < ((var_1_31 - var_1_33))) ? (var_1_26) : ((var_1_31 - var_1_33)))))) ? (4) : (((((var_1_26) < ((var_1_31 - var_1_33))) ? (var_1_26) : ((var_1_31 - var_1_33))))))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L80] EXPR var_1_11 & var_1_19 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L80] EXPR (var_1_11 & var_1_19) ^ var_1_11 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L80] EXPR var_1_11 & var_1_33 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L80] COND FALSE !(((var_1_11 & var_1_19) ^ var_1_11) < (var_1_11 & var_1_33)) [L85] EXPR var_1_17 & (~ var_1_11) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L85] COND TRUE (var_1_17 & (~ var_1_11)) <= var_1_1 [L86] COND TRUE \read(var_1_35) [L87] var_1_36 = ((((var_1_11) > (((((var_1_1) < (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? (var_1_1) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))))))) ? (var_1_11) : (((((var_1_1) < (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? (var_1_1) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))))))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L94] signed long int stepLocal_2 = var_1_3 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L95] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=-128, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L106] COND TRUE var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16)) [L107] var_1_19 = ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98242, var_1_19=67, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L111] var_1_17 = (var_1_18 - var_1_3) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=63, var_1_18=-98242, var_1_19=67, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2] [L112] COND TRUE (var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10) [L113] var_1_10 = var_1_9 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=63, var_1_18=-98242, var_1_19=67, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L115] COND FALSE !(var_1_10 >= var_1_10) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=63, var_1_18=-98242, var_1_19=67, var_1_1=256, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L120] COND TRUE (var_1_2 - var_1_3) > var_1_17 [L121] var_1_1 = (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=63, var_1_18=-98242, var_1_19=67, var_1_1=63, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L125] signed long int stepLocal_1 = var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))); [L126] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_1=31, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=63, var_1_18=-98242, var_1_19=67, var_1_1=63, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L127] COND FALSE !((var_1_19 / var_1_8) < stepLocal_1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=32767, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=63, var_1_18=-98242, var_1_19=67, var_1_1=63, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L203] RET step() [L204] CALL, EXPR property() [L194-L195] return ((((((((var_1_2 - var_1_3) > var_1_17) ? (var_1_1 == ((signed long int) (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))))) : (var_1_1 == ((signed long int) 0))) && (((var_1_19 / var_1_8) < (var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))))) ? ((var_1_1 >= var_1_3) ? (var_1_7 == ((float) 0.75f)) : (var_1_7 == ((float) var_1_9))) : 1)) && (((var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10)) ? (var_1_10 == ((float) var_1_9)) : 1)) && ((var_1_10 >= var_1_10) ? ((var_1_9 < var_1_10) ? (var_1_11 == ((signed char) var_1_12)) : 1) : 1)) && (var_1_14 ? ((last_1_var_1_13 <= var_1_9) ? (var_1_13 == ((double) var_1_9)) : ((((((last_1_var_1_17) < ((var_1_2 * last_1_var_1_17))) ? (last_1_var_1_17) : ((var_1_2 * last_1_var_1_17)))) == (var_1_3 + last_1_var_1_19)) ? (var_1_13 == ((double) 8.75)) : (var_1_13 == ((double) (16.5 + ((var_1_15 - 49.35) - var_1_16)))))) : 1)) && (var_1_17 == ((unsigned short int) (var_1_18 - var_1_3)))) && ((var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16))) ? (var_1_19 == ((signed char) ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))))) : (var_1_19 == ((signed char) var_1_12))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=63, var_1_18=-98242, var_1_19=67, var_1_1=63, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=63, var_1_18=-98242, var_1_19=67, var_1_1=63, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=66, var_1_13=9/10, var_1_14=0, var_1_17=63, var_1_18=-98242, var_1_19=67, var_1_1=63, var_1_22=67, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=1, var_1_2=32831, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=256, var_1_37=0, var_1_3=32767, var_1_7=644/5, var_1_8=2, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 9, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 787 mSDsluCounter, 2235 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1090 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 818 IncrementalHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 1145 mSDtfsCounter, 818 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 249 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2316 NumberOfCodeBlocks, 2316 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1881 ConstructedInterpolants, 0 QuantifiedInterpolants, 7396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 479 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 17794/17856 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 12:04:53,866 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_fillercodestructure_filler-ps-co_file-37.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 67842bd2132ccd8a41236e85d94558bf263880db0378e3df7d9b2f0e5d6e4ad1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:04:56,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:04:56,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:04:56,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:04:56,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:04:56,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:04:56,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:04:56,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:04:56,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:04:56,348 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:04:56,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:04:56,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:04:56,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:04:56,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:04:56,349 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:04:56,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:04:56,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:04:56,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:04:56,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:04:56,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:04:56,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:04:56,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:04:56,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:04:56,350 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:04:56,350 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:04:56,350 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:04:56,350 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:04:56,351 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:04:56,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:04:56,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:04:56,351 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:04:56,352 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:04:56,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:04:56,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:04:56,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:04:56,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:04:56,352 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 -> 67842bd2132ccd8a41236e85d94558bf263880db0378e3df7d9b2f0e5d6e4ad1 [2025-01-09 12:04:56,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:04:56,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:04:56,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:04:56,654 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:04:56,656 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:04:56,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2025-01-09 12:04:57,875 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4edccdd2e/623a11860d9f40a3a078010ddd8bb8b9/FLAGa6db7b48c [2025-01-09 12:04:58,109 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:04:58,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2025-01-09 12:04:58,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4edccdd2e/623a11860d9f40a3a078010ddd8bb8b9/FLAGa6db7b48c [2025-01-09 12:04:58,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4edccdd2e/623a11860d9f40a3a078010ddd8bb8b9 [2025-01-09 12:04:58,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:04:58,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:04:58,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:04:58,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:04:58,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:04:58,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a73736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58, skipping insertion in model container [2025-01-09 12:04:58,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:04:58,583 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_fillercodestructure_filler-ps-co_file-37.i[919,932] [2025-01-09 12:04:58,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:04:58,657 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:04:58,666 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_fillercodestructure_filler-ps-co_file-37.i[919,932] [2025-01-09 12:04:58,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:04:58,701 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:04:58,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58 WrapperNode [2025-01-09 12:04:58,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:04:58,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:04:58,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:04:58,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:04:58,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,749 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2025-01-09 12:04:58,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:04:58,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:04:58,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:04:58,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:04:58,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,773 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 12:04:58,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,783 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:04:58,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:04:58,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:04:58,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:04:58,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (1/1) ... [2025-01-09 12:04:58,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:04:58,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:04:58,833 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 12:04:58,841 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 12:04:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:04:58,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:04:58,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:04:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:04:58,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:04:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:04:58,939 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:04:58,941 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:05:12,383 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:05:12,383 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:05:12,390 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:05:12,390 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:05:12,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:05:12 BoogieIcfgContainer [2025-01-09 12:05:12,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:05:12,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:05:12,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:05:12,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:05:12,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:04:58" (1/3) ... [2025-01-09 12:05:12,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134018ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:05:12, skipping insertion in model container [2025-01-09 12:05:12,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:58" (2/3) ... [2025-01-09 12:05:12,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134018ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:05:12, skipping insertion in model container [2025-01-09 12:05:12,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:05:12" (3/3) ... [2025-01-09 12:05:12,397 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i [2025-01-09 12:05:12,406 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:05:12,408 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-37.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:05:12,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:05:12,451 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;@ad49466, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:05:12,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:05:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 12:05:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 12:05:12,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:12,462 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:12,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:12,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:12,466 INFO L85 PathProgramCache]: Analyzing trace with hash -591260460, now seen corresponding path program 1 times [2025-01-09 12:05:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:05:12,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148887916] [2025-01-09 12:05:12,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:12,474 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 12:05:12,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:05:12,476 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 12:05:12,478 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 12:05:12,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 12:05:13,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 12:05:13,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:13,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:13,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:05:13,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:05:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 12:05:13,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:05:13,140 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:05:13,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148887916] [2025-01-09 12:05:13,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148887916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:13,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:13,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:05:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114073621] [2025-01-09 12:05:13,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:13,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:05:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:05:13,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:05:13,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:05:13,157 INFO L87 Difference]: Start difference. First operand has 92 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 12:05:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:13,175 INFO L93 Difference]: Finished difference Result 178 states and 319 transitions. [2025-01-09 12:05:13,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:05:13,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 204 [2025-01-09 12:05:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:13,180 INFO L225 Difference]: With dead ends: 178 [2025-01-09 12:05:13,180 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 12:05:13,182 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 12:05:13,184 INFO L435 NwaCegarLoop]: 138 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, 138 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 12:05:13,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:05:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 12:05:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 12:05:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 12:05:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2025-01-09 12:05:13,211 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 204 [2025-01-09 12:05:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:13,213 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-01-09 12:05:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 12:05:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2025-01-09 12:05:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 12:05:13,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:13,217 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:13,236 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 (2)] Ended with exit code 0 [2025-01-09 12:05:13,422 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 12:05:13,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:13,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:13,424 INFO L85 PathProgramCache]: Analyzing trace with hash 132545430, now seen corresponding path program 1 times [2025-01-09 12:05:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:05:13,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045848296] [2025-01-09 12:05:13,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:13,426 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 12:05:13,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:05:13,428 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 12:05:13,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 12:05:13,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 12:05:13,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 12:05:13,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:13,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:13,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:05:13,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:05:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 12:05:18,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:05:18,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:05:18,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045848296] [2025-01-09 12:05:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045848296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:18,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:18,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:05:18,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319553035] [2025-01-09 12:05:18,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:18,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:05:18,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:05:18,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:05:18,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:05:18,917 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:05:23,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:05:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:23,422 INFO L93 Difference]: Finished difference Result 247 states and 388 transitions. [2025-01-09 12:05:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:05:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2025-01-09 12:05:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:23,429 INFO L225 Difference]: With dead ends: 247 [2025-01-09 12:05:23,429 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 12:05:23,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 202 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 12:05:23,430 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 24 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:05:23,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 246 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 12:05:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 12:05:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2025-01-09 12:05:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 12:05:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 238 transitions. [2025-01-09 12:05:23,452 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 238 transitions. Word has length 204 [2025-01-09 12:05:23,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:23,453 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 238 transitions. [2025-01-09 12:05:23,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:05:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 238 transitions. [2025-01-09 12:05:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 12:05:23,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:23,455 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:23,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:05:23,659 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 12:05:23,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:23,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash 548028579, now seen corresponding path program 1 times [2025-01-09 12:05:23,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:05:23,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272518056] [2025-01-09 12:05:23,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:23,661 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 12:05:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:05:23,664 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 12:05:23,666 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 12:05:23,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:05:24,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:05:24,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:24,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:24,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:05:24,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:05:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 12:05:29,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:05:29,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:05:29,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272518056] [2025-01-09 12:05:29,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272518056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:05:29,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:05:29,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:05:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773765451] [2025-01-09 12:05:29,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:05:29,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:05:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:05:29,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:05:29,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:05:29,175 INFO L87 Difference]: Start difference. First operand 154 states and 238 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:05:33,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:05:34,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:05:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:05:35,037 INFO L93 Difference]: Finished difference Result 253 states and 394 transitions. [2025-01-09 12:05:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:05:35,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2025-01-09 12:05:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:05:35,040 INFO L225 Difference]: With dead ends: 253 [2025-01-09 12:05:35,040 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 12:05:35,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 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 12:05:35,042 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 21 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:05:35,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 242 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-01-09 12:05:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 12:05:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2025-01-09 12:05:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 12:05:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 237 transitions. [2025-01-09 12:05:35,058 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 237 transitions. Word has length 205 [2025-01-09 12:05:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:05:35,058 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 237 transitions. [2025-01-09 12:05:35,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:05:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 237 transitions. [2025-01-09 12:05:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 12:05:35,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:05:35,061 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:05:35,083 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 12:05:35,261 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 12:05:35,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:05:35,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:05:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash -269619871, now seen corresponding path program 1 times [2025-01-09 12:05:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:05:35,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733197065] [2025-01-09 12:05:35,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:05:35,268 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 12:05:35,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:05:35,270 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 12:05:35,271 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 12:05:35,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:05:35,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:05:35,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:05:35,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:05:35,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:05:35,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:05:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 768 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2025-01-09 12:05:47,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:05:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-01-09 12:05:49,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:05:49,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733197065] [2025-01-09 12:05:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733197065] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:05:49,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:05:49,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-09 12:05:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764099165] [2025-01-09 12:05:49,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:05:49,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:05:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:05:49,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:05:49,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:05:49,629 INFO L87 Difference]: Start difference. First operand 154 states and 237 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-01-09 12:05:54,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:05:57,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:05:59,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:06:03,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:06:07,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:06:11,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:06:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:06:11,522 INFO L93 Difference]: Finished difference Result 252 states and 382 transitions. [2025-01-09 12:06:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:06:11,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 205 [2025-01-09 12:06:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:06:11,573 INFO L225 Difference]: With dead ends: 252 [2025-01-09 12:06:11,573 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 12:06:11,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:06:11,574 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 291 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 216 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:06:11,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 202 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 207 Invalid, 3 Unknown, 0 Unchecked, 20.8s Time] [2025-01-09 12:06:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 12:06:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2025-01-09 12:06:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 93 states have internal predecessors, (114), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 12:06:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 242 transitions. [2025-01-09 12:06:11,615 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 242 transitions. Word has length 205 [2025-01-09 12:06:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:06:11,616 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 242 transitions. [2025-01-09 12:06:11,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2025-01-09 12:06:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 242 transitions. [2025-01-09 12:06:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 12:06:11,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:06:11,620 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:06:11,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 12:06:11,820 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 12:06:11,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:06:11,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:06:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash -565816182, now seen corresponding path program 1 times [2025-01-09 12:06:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:06:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499481183] [2025-01-09 12:06:11,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:06:11,821 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 12:06:11,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:06:11,824 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 12:06:11,826 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 12:06:11,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 12:06:12,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 12:06:12,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:06:12,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:06:12,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:06:12,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:06:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 12:06:12,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:06:12,383 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:06:12,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499481183] [2025-01-09 12:06:12,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499481183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:06:12,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:06:12,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:06:12,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637458119] [2025-01-09 12:06:12,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:06:12,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:06:12,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:06:12,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:06:12,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:06:12,386 INFO L87 Difference]: Start difference. First operand 162 states and 242 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:06:16,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:06:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:06:17,056 INFO L93 Difference]: Finished difference Result 256 states and 382 transitions. [2025-01-09 12:06:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:06:17,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2025-01-09 12:06:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:06:17,059 INFO L225 Difference]: With dead ends: 256 [2025-01-09 12:06:17,059 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 12:06:17,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 204 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 12:06:17,060 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 35 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:06:17,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 267 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 12:06:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 12:06:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-01-09 12:06:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 96 states have internal predecessors, (116), 64 states have call successors, (64), 5 states have call predecessors, (64), 5 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 12:06:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 244 transitions. [2025-01-09 12:06:17,076 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 244 transitions. Word has length 206 [2025-01-09 12:06:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:06:17,077 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 244 transitions. [2025-01-09 12:06:17,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 12:06:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 244 transitions. [2025-01-09 12:06:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 12:06:17,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:06:17,079 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:06:17,116 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 (6)] Forceful destruction successful, exit code 0 [2025-01-09 12:06:17,279 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 12:06:17,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:06:17,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:06:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1375162808, now seen corresponding path program 1 times [2025-01-09 12:06:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:06:17,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932153997] [2025-01-09 12:06:17,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:06:17,280 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 12:06:17,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:06:17,282 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 12:06:17,284 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 12:06:17,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 12:06:17,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 12:06:17,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:06:17,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:06:17,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 12:06:17,945 INFO L279 TraceCheckSpWp]: Computing forward predicates...